Base | Representation |
---|---|
bin | 101111101111111011110010… |
… | …100010111010101001011011 |
3 | 1000112120000101101221120010110 |
4 | 233233323302202322221123 |
5 | 210011134001223210021 |
6 | 2022345402352415403 |
7 | 62143105201314426 |
oct | 5757736242725133 |
9 | 1015500341846113 |
10 | 210002200210011 |
11 | 60a054842aa750 |
12 | 1b6779bbb47563 |
13 | 90241791c0501 |
14 | 39c02370469bd |
15 | 194298c241476 |
hex | befef28baa5b |
210002200210011 has 16 divisors (see below), whose sum is σ = 312907934683008. Its totient is φ = 124169815348800.
The previous prime is 210002200209983. The next prime is 210002200210039. The reversal of 210002200210011 is 110012002200012.
It is an interprime number because it is at equal distance from previous prime (210002200209983) and next prime (210002200210039).
It is not a de Polignac number, because 210002200210011 - 26 = 210002200209947 is a prime.
It is not an unprimeable number, because it can be changed into a prime (210002200210511) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 77606133241 + ... + 77606135946.
It is an arithmetic number, because the mean of its divisors is an integer number (19556745917688).
Almost surely, 2210002200210011 is an apocalyptic number.
210002200210011 is a deficient number, since it is larger than the sum of its proper divisors (102905734472997).
210002200210011 is a wasteful number, since it uses less digits than its factorization.
210002200210011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 155212269242.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 210002200210011 its reverse (110012002200012), we get a palindrome (320014202410023).
The spelling of 210002200210011 in words is "two hundred ten trillion, two billion, two hundred million, two hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •