Base | Representation |
---|---|
bin | 110000010000000011111110… |
… | …110111000110111111101001 |
3 | 1000211101002011011102121112120 |
4 | 300100003332313012333221 |
5 | 210303322110111121301 |
6 | 2031155534245301453 |
7 | 62461445060131110 |
oct | 6020037667067751 |
9 | 1024332134377476 |
10 | 212210020020201 |
11 | 61686844aa7885 |
12 | 1b973882404889 |
13 | 915441bb77768 |
14 | 3a5903c378c77 |
15 | 1980109e48e36 |
hex | c100fedc6fe9 |
212210020020201 has 8 divisors (see below), whose sum is σ = 323367649554624. Its totient is φ = 121262868582960.
The previous prime is 212210020020191. The next prime is 212210020020217. The reversal of 212210020020201 is 102020020012212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 212210020020201 - 25 = 212210020020169 is a prime.
It is not an unprimeable number, because it can be changed into a prime (212210020030201) 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, 5052619524270 + ... + 5052619524311.
It is an arithmetic number, because the mean of its divisors is an integer number (40420956194328).
Almost surely, 2212210020020201 is an apocalyptic number.
212210020020201 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
212210020020201 is a deficient number, since it is larger than the sum of its proper divisors (111157629534423).
212210020020201 is a wasteful number, since it uses less digits than its factorization.
212210020020201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10105239048591.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 212210020020201 its reverse (102020020012212), we get a palindrome (314230040032413).
The spelling of 212210020020201 in words is "two hundred twelve trillion, two hundred ten billion, twenty million, twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •