Base | Representation |
---|---|
bin | 10111001100100101101000… |
… | …011010101010100000100011 |
3 | 111101020000201212200100011111 |
4 | 113030211220122222200203 |
5 | 101332444141130032321 |
6 | 1000551220322524151 |
7 | 30326465300635342 |
oct | 2714455032524043 |
9 | 441200655610144 |
10 | 102020110002211 |
11 | 2a56353848a2a5 |
12 | b538220506657 |
13 | 44c05bbabb2bb |
14 | 1b29b2a41db59 |
15 | bbdb9cee65e1 |
hex | 5cc9686aa823 |
102020110002211 has 8 divisors (see below), whose sum is σ = 103072195306080. Its totient is φ = 100968031465728.
The previous prime is 102020110002199. The next prime is 102020110002229. The reversal of 102020110002211 is 112200011020201.
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 102020110002211 - 217 = 102020109871139 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102020110002191 and 102020110002200.
It is not an unprimeable number, because it can be changed into a prime (102020110002281) 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, 32070210 + ... + 35107528.
It is an arithmetic number, because the mean of its divisors is an integer number (12884024413260).
Almost surely, 2102020110002211 is an apocalyptic number.
102020110002211 is a deficient number, since it is larger than the sum of its proper divisors (1052085303869).
102020110002211 is an equidigital number, since it uses as much as digits as its factorization.
102020110002211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3383693.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 102020110002211 its reverse (112200011020201), we get a palindrome (214220121022412).
The spelling of 102020110002211 in words is "one hundred two trillion, twenty billion, one hundred ten million, two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •