Base | Representation |
---|---|
bin | 1001110011110011011001… |
… | …00100100110101000000000 |
3 | 2211101011220100021201102220 |
4 | 10321321230210212220000 |
5 | 10311410202201421412 |
6 | 113513352005211040 |
7 | 4354315065464103 |
oct | 471715444465000 |
9 | 84334810251386 |
10 | 21571147295232 |
11 | 69672aa320377 |
12 | 2504771700a80 |
13 | c061c57448b2 |
14 | 548098a3073a |
15 | 2761ad41a68c |
hex | 139e6c926a00 |
21571147295232 has 160 divisors (see below), whose sum is σ = 58253361070080. Its totient is φ = 7092161556480.
The previous prime is 21571147295221. The next prime is 21571147295249. The reversal of 21571147295232 is 23259274117512.
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 15 ways as a sum of consecutive naturals, for example, 120162213 + ... + 120341595.
It is an arithmetic number, because the mean of its divisors is an integer number (364083506688).
Almost surely, 221571147295232 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 21571147295232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (29126680535040).
21571147295232 is an abundant number, since it is smaller than the sum of its proper divisors (36682213774848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21571147295232 is an equidigital number, since it uses as much as digits as its factorization.
21571147295232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 180474 (or 180458 counting only the distinct ones).
The product of its digits is 2116800, while the sum is 51.
The spelling of 21571147295232 in words is "twenty-one trillion, five hundred seventy-one billion, one hundred forty-seven million, two hundred ninety-five thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •