Base | Representation |
---|---|
bin | 10111001100011101001001… |
… | …011011001100001110001011 |
3 | 111101012011012222210222010202 |
4 | 113030131021123030032023 |
5 | 101332322012012041021 |
6 | 1000543112334202415 |
7 | 30326023452100604 |
oct | 2714351133141613 |
9 | 441164188728122 |
10 | 102011000112011 |
11 | 2a55a693161a21 |
12 | b5364b965340b |
13 | 44bc799643923 |
14 | 1b295045a0dab |
15 | bbd81835ea0b |
hex | 5cc7496cc38b |
102011000112011 has 4 divisors (see below), whose sum is σ = 102332801374512. Its totient is φ = 101689198849512.
The previous prime is 102011000111963. The next prime is 102011000112017. The reversal of 102011000112011 is 110211000110201.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 102011000112011 - 234 = 101993820242827 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102011000111983 and 102011000112001.
It is not an unprimeable number, because it can be changed into a prime (102011000112017) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 160900630775 + ... + 160900631408.
It is an arithmetic number, because the mean of its divisors is an integer number (25583200343628).
Almost surely, 2102011000112011 is an apocalyptic number.
102011000112011 is a deficient number, since it is larger than the sum of its proper divisors (321801262501).
102011000112011 is an equidigital number, since it uses as much as digits as its factorization.
102011000112011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 321801262500.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 102011000112011 its reverse (110211000110201), we get a palindrome (212222000222212).
The spelling of 102011000112011 in words is "one hundred two trillion, eleven billion, one hundred twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •