Base | Representation |
---|---|
bin | 10111001100011110000101… |
… | …101111101010010010100011 |
3 | 111101012020211112001211210012 |
4 | 113030132011233222102203 |
5 | 101332331100100023021 |
6 | 1000543401004555135 |
7 | 30326060520665162 |
oct | 2714360557522243 |
9 | 441166745054705 |
10 | 102012012111011 |
11 | 2a560062430832 |
12 | b536740552aab |
13 | 44bc8cb1c24c2 |
14 | 1b2959cb533d9 |
15 | bbd87711135b |
hex | 5cc785bea4a3 |
102012012111011 has 8 divisors (see below), whose sum is σ = 102133796578800. Its totient is φ = 101890234686240.
The previous prime is 102012012110933. The next prime is 102012012111029. The reversal of 102012012111011 is 110111210210201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 102012012111011 - 218 = 102012011848867 is a prime.
It is a super-2 number, since 2×1020120121110112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102012012111071) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 27515105 + ... + 31001693.
It is an arithmetic number, because the mean of its divisors is an integer number (12766724572350).
Almost surely, 2102012012111011 is an apocalyptic number.
102012012111011 is a deficient number, since it is larger than the sum of its proper divisors (121784467789).
102012012111011 is an equidigital number, since it uses as much as digits as its factorization.
102012012111011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3521509.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 102012012111011 its reverse (110111210210201), we get a palindrome (212123222321212).
The spelling of 102012012111011 in words is "one hundred two trillion, twelve billion, twelve million, one hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •