Base | Representation |
---|---|
bin | 101111110000000100111011… |
… | …110110100001011111100101 |
3 | 1000112120221201202122122200221 |
4 | 233300010323312201133211 |
5 | 210011314104111134341 |
6 | 2022354105021204341 |
7 | 62143603430323555 |
oct | 5760047366413745 |
9 | 1015527652578627 |
10 | 210012020021221 |
11 | 60a09663333200 |
12 | 1b6798a07006b1 |
13 | 902508276bba2 |
14 | 39c08c92a3165 |
15 | 1942d643a9ed1 |
hex | bf013bda17e5 |
210012020021221 has 48 divisors (see below), whose sum is σ = 243299638923264. Its totient is φ = 180788043744000.
The previous prime is 210012020021171. The next prime is 210012020021269. The reversal of 210012020021221 is 122120020210012.
It is a happy number.
It is not a de Polignac number, because 210012020021221 - 231 = 210009872537573 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 210012020021195 and 210012020021204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210012020021281) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 162291841 + ... + 163580761.
It is an arithmetic number, because the mean of its divisors is an integer number (5068742477568).
Almost surely, 2210012020021221 is an apocalyptic number.
It is an amenable number.
210012020021221 is a deficient number, since it is larger than the sum of its proper divisors (33287618902043).
210012020021221 is a wasteful number, since it uses less digits than its factorization.
210012020021221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1289554 (or 1289543 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 210012020021221 its reverse (122120020210012), we get a palindrome (332132040231233).
The spelling of 210012020021221 in words is "two hundred ten trillion, twelve billion, twenty million, twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •