Base | Representation |
---|---|
bin | 1001101001100111011000… |
… | …01111110001111101011100 |
3 | 2210010201101002022101110021 |
4 | 10310303230033301331130 |
5 | 10240141304103031022 |
6 | 113044501211521524 |
7 | 4320113455543453 |
oct | 464635417617534 |
9 | 83121332271407 |
10 | 21221102002012 |
11 | 6841900935610 |
12 | 24689601592a4 |
13 | bac1ab678363 |
14 | 53516d16bb9a |
15 | 26c02241b7c7 |
hex | 134cec3f1f5c |
21221102002012 has 24 divisors (see below), whose sum is σ = 40914131861232. Its totient is φ = 9550450944000.
The previous prime is 21221102002007. The next prime is 21221102002013. The reversal of 21221102002012 is 21020020112212.
It is a happy number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21221102002013) 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, 2387608293 + ... + 2387617180.
It is an arithmetic number, because the mean of its divisors is an integer number (1704755494218).
Almost surely, 221221102002012 is an apocalyptic number.
21221102002012 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
21221102002012 is a deficient number, since it is larger than the sum of its proper divisors (19693029859220).
21221102002012 is a wasteful number, since it uses less digits than its factorization.
21221102002012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4775225589 (or 4775225587 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 21221102002012 its reverse (21020020112212), we get a palindrome (42241122114224).
It can be divided in two parts, 2122110200 and 2012, that added together give a palindrome (2122112212).
The spelling of 21221102002012 in words is "twenty-one trillion, two hundred twenty-one billion, one hundred two million, two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •