Base | Representation |
---|---|
bin | 1001101001011100110111… |
… | …00000111000101010011000 |
3 | 2210010011210100220012120211 |
4 | 10310232123200320222120 |
5 | 10240043221324022440 |
6 | 113042124440500504 |
7 | 4316523456243163 |
oct | 464563340705230 |
9 | 83104710805524 |
10 | 21215452564120 |
11 | 683a471983281 |
12 | 246784417a734 |
13 | bab7bb1015b9 |
14 | 534b94b34ada |
15 | 26bce147deea |
hex | 134b9b838a98 |
21215452564120 has 32 divisors (see below), whose sum is σ = 47754799859520. Its totient is φ = 8482619854080.
The previous prime is 21215452564093. The next prime is 21215452564157. The reversal of 21215452564120 is 2146525451212.
It is a super-2 number, since 2×212154525641202 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (40).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 111190101 + ... + 111380740.
It is an arithmetic number, because the mean of its divisors is an integer number (1492337495610).
Almost surely, 221215452564120 is an apocalyptic number.
21215452564120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
21215452564120 is an abundant number, since it is smaller than the sum of its proper divisors (26539347295400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21215452564120 is a wasteful number, since it uses less digits than its factorization.
21215452564120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 222573235 (or 222573231 counting only the distinct ones).
The product of its (nonzero) digits is 192000, while the sum is 40.
The spelling of 21215452564120 in words is "twenty-one trillion, two hundred fifteen billion, four hundred fifty-two million, five hundred sixty-four thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •