Base | Representation |
---|---|
bin | 1001100011001101101000… |
… | …11101001101001110001000 |
3 | 2202100200120100101020111000 |
4 | 10301212310131031032020 |
5 | 10223040244400242402 |
6 | 112355441011135000 |
7 | 4265165253203514 |
oct | 461466435151610 |
9 | 82320510336430 |
10 | 21001122665352 |
11 | 6767587279035 |
12 | 24321a95a4460 |
13 | b945220378ab |
14 | 528661823144 |
15 | 266449e5dc1c |
hex | 1319b474d388 |
21001122665352 has 128 divisors (see below), whose sum is σ = 59685460243200. Its totient is φ = 6840013248000.
The previous prime is 21001122665339. The next prime is 21001122665387. The reversal of 21001122665352 is 25356622110012.
21001122665352 is a `hidden beast` number, since 2 + 1 + 0 + 0 + 112 + 2 + 6 + 6 + 535 + 2 = 666.
It is a super-2 number, since 2×210011226653522 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
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, 3288213 + ... + 7267364.
It is an arithmetic number, because the mean of its divisors is an integer number (466292658150).
Almost surely, 221001122665352 is an apocalyptic number.
It is an amenable number.
21001122665352 is an abundant number, since it is smaller than the sum of its proper divisors (38684337577848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21001122665352 is a wasteful number, since it uses less digits than its factorization.
21001122665352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10555804 (or 10555794 counting only the distinct ones).
The product of its (nonzero) digits is 43200, while the sum is 36.
Adding to 21001122665352 its reverse (25356622110012), we get a palindrome (46357744775364).
The spelling of 21001122665352 in words is "twenty-one trillion, one billion, one hundred twenty-two million, six hundred sixty-five thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •