Base | Representation |
---|---|
bin | 101111101111111011100111… |
… | …001101110001111101001011 |
3 | 1000112112222220011020222200002 |
4 | 233233323213031301331023 |
5 | 210011133104042320021 |
6 | 2022345331442233215 |
7 | 62143100402503244 |
oct | 5757734715617513 |
9 | 1015488804228602 |
10 | 210002010120011 |
11 | 60a05396a7627a |
12 | 1b67796835580b |
13 | 90241489c5b15 |
14 | 39c0219ac3ccb |
15 | 194297a6e350b |
hex | befee7371f4b |
210002010120011 has 8 divisors (see below), whose sum is σ = 213570084840000. Its totient is φ = 206434226020680.
The previous prime is 210002010119999. The next prime is 210002010120131. The reversal of 210002010120011 is 110021010200012.
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 210002010120011 - 26 = 210002010119947 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 210002010119974 and 210002010120001.
It is not an unprimeable number, because it can be changed into a prime (210002010120211) 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, 71197445 + ... + 74088326.
It is an arithmetic number, because the mean of its divisors is an integer number (26696260605000).
Almost surely, 2210002010120011 is an apocalyptic number.
210002010120011 is a deficient number, since it is larger than the sum of its proper divisors (3568074719989).
210002010120011 is a wasteful number, since it uses less digits than its factorization.
210002010120011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 145310329.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 210002010120011 its reverse (110021010200012), we get a palindrome (320023020320023).
The spelling of 210002010120011 in words is "two hundred ten trillion, two billion, ten million, one hundred twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •