Base | Representation |
---|---|
bin | 10010101000010101… |
… | …00110110100111011 |
3 | 221211001112022021022 |
4 | 21110022212310323 |
5 | 130441003014321 |
6 | 4332253333055 |
7 | 502600415246 |
oct | 112412466473 |
9 | 27731468238 |
10 | 10002001211 |
11 | 4272961604 |
12 | 1b3179718b |
13 | c3523b317 |
14 | 6ac52425d |
15 | 3d8155dab |
hex | 2542a6d3b |
10002001211 has 4 divisors (see below), whose sum is σ = 10093762800. Its totient is φ = 9910239624.
The previous prime is 10002001181. The next prime is 10002001253. The reversal of 10002001211 is 11210020001.
10002001211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 11210020001 = 59 ⋅190000339.
It is a cyclic number.
It is not a de Polignac number, because 10002001211 - 210 = 10002000187 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10002001271) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 45880631 + ... + 45880848.
It is an arithmetic number, because the mean of its divisors is an integer number (2523440700).
Almost surely, 210002001211 is an apocalyptic number.
10002001211 is a deficient number, since it is larger than the sum of its proper divisors (91761589).
10002001211 is an equidigital number, since it uses as much as digits as its factorization.
10002001211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91761588.
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 10002001211 its reverse (11210020001), we get a palindrome (21212021212).
The spelling of 10002001211 in words is "ten billion, two million, one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •