Base | Representation |
---|---|
bin | 10111001100011100010011… |
… | …110001100010110011011011 |
3 | 111101012001220021002122100100 |
4 | 113030130103301202303123 |
5 | 101332313141100031021 |
6 | 1000542443141510443 |
7 | 30325662242223315 |
oct | 2714342361426333 |
9 | 441161807078310 |
10 | 102010100002011 |
11 | 2a55a271064a63 |
12 | b5362a8112423 |
13 | 44bc68500c166 |
14 | 1b2945ac167b5 |
15 | bbd7b4310626 |
hex | 5cc713c62cdb |
102010100002011 has 24 divisors (see below), whose sum is σ = 149118935500080. Its totient is φ = 67190526374400.
The previous prime is 102010100002009. The next prime is 102010100002049. The reversal of 102010100002011 is 110200001010201.
It is a happy number.
It is not a de Polignac number, because 102010100002011 - 21 = 102010100002009 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 102010100001984 and 102010100002002.
It is not an unprimeable number, because it can be changed into a prime (102010100001011) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 48289470 + ... + 50357651.
It is an arithmetic number, because the mean of its divisors is an integer number (6213288979170).
Almost surely, 2102010100002011 is an apocalyptic number.
102010100002011 is a deficient number, since it is larger than the sum of its proper divisors (47108835498069).
102010100002011 is a wasteful number, since it uses less digits than its factorization.
102010100002011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 98648507 (or 98648504 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 102010100002011 its reverse (110200001010201), we get a palindrome (212210101012212).
The spelling of 102010100002011 in words is "one hundred two trillion, ten billion, one hundred million, two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •