Base | Representation |
---|---|
bin | 10111001101110000000010… |
… | …111101000001100010001011 |
3 | 111101111122222101121002001111 |
4 | 113031300002331001202023 |
5 | 101340301311100041021 |
6 | 1001052033102231151 |
7 | 30335324323442644 |
oct | 2715600275014213 |
9 | 441448871532044 |
10 | 102100012112011 |
11 | 2a594410105a91 |
12 | b54b7bb5854b7 |
13 | 44c7cb386aa04 |
14 | 1b2d94a1966cb |
15 | bc0cc7aca8e1 |
hex | 5cdc02f4188b |
102100012112011 has 4 divisors (see below), whose sum is σ = 103054217832792. Its totient is φ = 101145806391232.
The previous prime is 102100012112003. The next prime is 102100012112023. The reversal of 102100012112011 is 110211210001201.
It is a happy number.
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 102100012112011 - 23 = 102100012112003 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102100012111982 and 102100012112000.
It is not an unprimeable number, because it can be changed into a prime (102100012112311) 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, 477102860230 + ... + 477102860443.
It is an arithmetic number, because the mean of its divisors is an integer number (25763554458198).
Almost surely, 2102100012112011 is an apocalyptic number.
102100012112011 is a deficient number, since it is larger than the sum of its proper divisors (954205720781).
102100012112011 is an equidigital number, since it uses as much as digits as its factorization.
102100012112011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 954205720780.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 102100012112011 its reverse (110211210001201), we get a palindrome (212311222113212).
The spelling of 102100012112011 in words is "one hundred two trillion, one hundred billion, twelve million, one hundred twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •