Base | Representation |
---|---|
bin | 1001101001010011000111… |
… | …01000101010000010110010 |
3 | 2210002200021201002222220212 |
4 | 10310221203220222002302 |
5 | 10240002012322010002 |
6 | 113035501323104122 |
7 | 4316250012152000 |
oct | 464514350520262 |
9 | 83080251088825 |
10 | 21210220110002 |
11 | 6838227337030 |
12 | 2466823972042 |
13 | bab1660646c1 |
14 | 534819c43a70 |
15 | 26bad6e0c352 |
hex | 134a63a2a0b2 |
21210220110002 has 64 divisors (see below), whose sum is σ = 40476942432000. Its totient is φ = 8263401834240.
The previous prime is 21210220109963. The next prime is 21210220110059. The reversal of 21210220110002 is 20001102201212.
It is a super-2 number, since 2×212102201100022 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 316664588 + ... + 316731560.
It is an arithmetic number, because the mean of its divisors is an integer number (632452225500).
Almost surely, 221210220110002 is an apocalyptic number.
21210220110002 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
21210220110002 is a deficient number, since it is larger than the sum of its proper divisors (19266722321998).
21210220110002 is a wasteful number, since it uses less digits than its factorization.
21210220110002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 108976 (or 108962 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 21210220110002 its reverse (20001102201212), we get a palindrome (41211322311214).
The spelling of 21210220110002 in words is "twenty-one trillion, two hundred ten billion, two hundred twenty million, one hundred ten thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •