Base | Representation |
---|---|
bin | 101111110000001110001111… |
… | …011010111001111011100101 |
3 | 1000112121220112010022212112220 |
4 | 233300032033122321323211 |
5 | 210012000040033031041 |
6 | 2022402440320102553 |
7 | 62144406146626122 |
oct | 5760161732717345 |
9 | 1015556463285486 |
10 | 210022012002021 |
11 | 60a1292057027a |
12 | 1b67b80aa64a59 |
13 | 9025cb58ac26b |
14 | 39c1196339749 |
15 | 194324b6d1d66 |
hex | bf038f6b9ee5 |
210022012002021 has 8 divisors (see below), whose sum is σ = 280093035810144. Its totient is φ = 139982831430960.
The previous prime is 210022012001983. The next prime is 210022012002031. The reversal of 210022012002021 is 120200210220012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 210022012002021 - 211 = 210022011999973 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210022012002031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7960793875 + ... + 7960820256.
It is an arithmetic number, because the mean of its divisors is an integer number (35011629476268).
Almost surely, 2210022012002021 is an apocalyptic number.
It is an amenable number.
210022012002021 is a deficient number, since it is larger than the sum of its proper divisors (70071023808123).
210022012002021 is a wasteful number, since it uses less digits than its factorization.
210022012002021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15921618531.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 210022012002021 its reverse (120200210220012), we get a palindrome (330222222222033).
The spelling of 210022012002021 in words is "two hundred ten trillion, twenty-two billion, twelve million, two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •