Base | Representation |
---|---|
bin | 1001110010000001100110… |
… | …00001010110101001111000 |
3 | 2211011100012112002212222021 |
4 | 10321000303001112221320 |
5 | 10304410041331230240 |
6 | 113425325341404224 |
7 | 4350023101026661 |
oct | 471006301265170 |
9 | 84140175085867 |
10 | 21510052211320 |
11 | 69433a8786592 |
12 | 24b4960b69674 |
13 | c0050a16857a |
14 | 54514095c368 |
15 | 2747d49a354a |
hex | 139033056a78 |
21510052211320 has 32 divisors (see below), whose sum is σ = 48417188105520. Its totient is φ = 8600541661440.
The previous prime is 21510052211269. The next prime is 21510052211387. The reversal of 21510052211320 is 2311225001512.
It is a happy number.
It is a super-2 number, since 2×215100522113202 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
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 7 ways as a sum of consecutive naturals, for example, 108625566 + ... + 108823405.
Almost surely, 221510052211320 is an apocalyptic number.
21510052211320 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
21510052211320 is an abundant number, since it is smaller than the sum of its proper divisors (26907135894200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21510052211320 is a wasteful number, since it uses less digits than its factorization.
21510052211320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 217451455 (or 217451451 counting only the distinct ones).
The product of its (nonzero) digits is 1200, while the sum is 25.
Adding to 21510052211320 its reverse (2311225001512), we get a palindrome (23821277212832).
The spelling of 21510052211320 in words is "twenty-one trillion, five hundred ten billion, fifty-two million, two hundred eleven thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •