Base | Representation |
---|---|
bin | 1001000110001101001001… |
… | …0010110101111111101001 |
3 | 1022102012110100112112002111 |
4 | 2101203102102311333221 |
5 | 2302334012234121301 |
6 | 33134541444202321 |
7 | 2051431065245632 |
oct | 221432222657751 |
9 | 38365410475074 |
10 | 10002212020201 |
11 | 3206a06a23595 |
12 | 11565b46993a1 |
13 | 57728750810b |
14 | 268176c18889 |
15 | 1252a9236551 |
hex | 918d24b5fe9 |
10002212020201 has 8 divisors (see below), whose sum is σ = 11051037321984. Its totient is φ = 9004548928320.
The previous prime is 10002212020187. The next prime is 10002212020211. The reversal of 10002212020201 is 10202021220001.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10002212020201 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10002212020211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12790552065 + ... + 12790552846.
It is an arithmetic number, because the mean of its divisors is an integer number (1381379665248).
Almost surely, 210002212020201 is an apocalyptic number.
It is an amenable number.
10002212020201 is a deficient number, since it is larger than the sum of its proper divisors (1048825301783).
10002212020201 is a wasteful number, since it uses less digits than its factorization.
10002212020201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25581104951.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 10002212020201 its reverse (10202021220001), we get a palindrome (20204233240202).
The spelling of 10002212020201 in words is "ten trillion, two billion, two hundred twelve million, twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •