Base | Representation |
---|---|
bin | 1001101001010010111010… |
… | …01101000110001100110010 |
3 | 2210002200000012002201102000 |
4 | 10310221131031012030302 |
5 | 10240001302212101002 |
6 | 113035442510434430 |
7 | 4316244232134504 |
oct | 464513515061462 |
9 | 83080005081360 |
10 | 21210112222002 |
11 | 68381814481a0 |
12 | 24667b3802a16 |
13 | bab1498bb752 |
14 | 53480979bd74 |
15 | 26bacc6ea61c |
hex | 134a5d346332 |
21210112222002 has 64 divisors (see below), whose sum is σ = 51419377134720. Its totient is φ = 6427191326400.
The previous prime is 21210112221971. The next prime is 21210112222051. The reversal of 21210112222002 is 20022221101212.
It is a happy number.
21210112222002 is a `hidden beast` number, since 21 + 210 + 11 + 222 + 200 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 36308352 + ... + 36887892.
It is an arithmetic number, because the mean of its divisors is an integer number (803427767730).
Almost surely, 221210112222002 is an apocalyptic number.
21210112222002 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
21210112222002 is an abundant number, since it is smaller than the sum of its proper divisors (30209264912718).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21210112222002 is a wasteful number, since it uses less digits than its factorization.
21210112222002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 641176 (or 641170 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 18.
Adding to 21210112222002 its reverse (20022221101212), we get a palindrome (41232333323214).
The spelling of 21210112222002 in words is "twenty-one trillion, two hundred ten billion, one hundred twelve million, two hundred twenty-two thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •