Base | Representation |
---|---|
bin | 10111001100011110000110… |
… | …001110100011100101011011 |
3 | 111101012020212002022022112011 |
4 | 113030132012032203211123 |
5 | 101332331104133210021 |
6 | 1000543401454330351 |
7 | 30326060646556342 |
oct | 2714360616434533 |
9 | 441166762268464 |
10 | 102012020210011 |
11 | 2a560066a6271a |
12 | b5367431b99b7 |
13 | 44bc8cca99a02 |
14 | 1b2959dc60b59 |
15 | bbd877bb0de1 |
hex | 5cc7863a395b |
102012020210011 has 4 divisors (see below), whose sum is σ = 102042718985592. Its totient is φ = 101981321434432.
The previous prime is 102012020210003. The next prime is 102012020210017. The reversal of 102012020210011 is 110012020210201.
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 102012020210011 - 23 = 102012020210003 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102012020209973 and 102012020210000.
It is not an unprimeable number, because it can be changed into a prime (102012020210017) 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, 15349382806 + ... + 15349389451.
It is an arithmetic number, because the mean of its divisors is an integer number (25510679746398).
Almost surely, 2102012020210011 is an apocalyptic number.
102012020210011 is a deficient number, since it is larger than the sum of its proper divisors (30698775581).
102012020210011 is an equidigital number, since it uses as much as digits as its factorization.
102012020210011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30698775580.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 102012020210011 its reverse (110012020210201), we get a palindrome (212024040420212).
The spelling of 102012020210011 in words is "one hundred two trillion, twelve billion, twenty million, two hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •