Base | Representation |
---|---|
bin | 1011000110001100101011… |
… | …0101000010001111110111 |
3 | 1121012102012100001200222212 |
4 | 2301203022311002033313 |
5 | 3044400333131133421 |
6 | 41541040151444035 |
7 | 2366333611000454 |
oct | 261431265021767 |
9 | 47172170050885 |
10 | 12201110021111 |
11 | 3984509585320 |
12 | 14507a708661b |
13 | 6a673798aa8b |
14 | 30277328a82b |
15 | 1625a3a59e5b |
hex | b18cad423f7 |
12201110021111 has 32 divisors (see below), whose sum is σ = 14453568315648. Its totient is φ = 10173654167040.
The previous prime is 12201110021101. The next prime is 12201110021143. The reversal of 12201110021111 is 11112001110221.
It is a de Polignac number, because none of the positive numbers 2k-12201110021111 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12201110021101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1849565 + ... + 5274761.
It is an arithmetic number, because the mean of its divisors is an integer number (451674009864).
Almost surely, 212201110021111 is an apocalyptic number.
12201110021111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
12201110021111 is a deficient number, since it is larger than the sum of its proper divisors (2252458294537).
12201110021111 is a wasteful number, since it uses less digits than its factorization.
12201110021111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3425711.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 12201110021111 its reverse (11112001110221), we get a palindrome (23313111131332).
The spelling of 12201110021111 in words is "twelve trillion, two hundred one billion, one hundred ten million, twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •