Base | Representation |
---|---|
bin | 1001110101001111110000… |
… | …00011110111110001010000 |
3 | 2211112220212222222002201101 |
4 | 10322213320003313301100 |
5 | 10313213224413241300 |
6 | 113552232141114144 |
7 | 4361021620101160 |
oct | 472477003676120 |
9 | 84486788862641 |
10 | 21620732165200 |
11 | 6986334724053 |
12 | 25122ab558954 |
13 | c0aa984a643c |
14 | 54a64017c5a0 |
15 | 27761160db6a |
hex | 13a9f80f7c50 |
21620732165200 has 60 divisors (see below), whose sum is σ = 59364353181280. Its totient is φ = 7412822455680.
The previous prime is 21620732165171. The next prime is 21620732165269. The reversal of 21620732165200 is 256123702612.
It is a self number, because there is not a number n which added to its sum of digits gives 21620732165200.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3860842230 + ... + 3860847829.
Almost surely, 221620732165200 is an apocalyptic number.
21620732165200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
21620732165200 is an abundant number, since it is smaller than the sum of its proper divisors (37743621016080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21620732165200 is a wasteful number, since it uses less digits than its factorization.
21620732165200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7721690084 (or 7721690073 counting only the distinct ones).
The product of its (nonzero) digits is 60480, while the sum is 37.
Adding to 21620732165200 its reverse (256123702612), we get a palindrome (21876855867812).
The spelling of 21620732165200 in words is "twenty-one trillion, six hundred twenty billion, seven hundred thirty-two million, one hundred sixty-five thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •