Base | Representation |
---|---|
bin | 1011000110001000111011… |
… | …0000001010011100100011 |
3 | 1121012022121002111120021011 |
4 | 2301202032300022130203 |
5 | 3044341302120023021 |
6 | 41540352144441351 |
7 | 2366266621623163 |
oct | 261421660123443 |
9 | 47168532446234 |
10 | 12200102111011 |
11 | 3984041649571 |
12 | 1450565619257 |
13 | 6a6606c11379 |
14 | 3026b94805a3 |
15 | 162545314de1 |
hex | b188ec0a723 |
12200102111011 has 16 divisors (see below), whose sum is σ = 12452387371200. Its totient is φ = 11949596104320.
The previous prime is 12200102111009. The next prime is 12200102111059. The reversal of 12200102111011 is 11011120100221.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 12200102111011 - 21 = 12200102111009 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12200102110982 and 12200102111000.
It is not an unprimeable number, because it can be changed into a prime (12200102111081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15432081 + ... + 16203373.
It is an arithmetic number, because the mean of its divisors is an integer number (778274210700).
Almost surely, 212200102111011 is an apocalyptic number.
12200102111011 is a deficient number, since it is larger than the sum of its proper divisors (252285260189).
12200102111011 is an equidigital number, since it uses as much as digits as its factorization.
12200102111011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 772446.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 12200102111011 its reverse (11011120100221), we get a palindrome (23211222211232).
The spelling of 12200102111011 in words is "twelve trillion, two hundred billion, one hundred two million, one hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •