Base | Representation |
---|---|
bin | 10100001000111011… |
… | …010110000100110001 |
3 | 2001211001112001202000 |
4 | 110020323112010301 |
5 | 323241400023441 |
6 | 13533442244213 |
7 | 1363610106321 |
oct | 241073260461 |
9 | 61731461660 |
10 | 21624611121 |
11 | 9197590443 |
12 | 4236056669 |
13 | 20681498a9 |
14 | 1091d85281 |
15 | 8686cc2b6 |
hex | 508ed6131 |
21624611121 has 8 divisors (see below), whose sum is σ = 32036460960. Its totient is φ = 14416407396.
The previous prime is 21624611093. The next prime is 21624611137. The reversal of 21624611121 is 12111642612.
21624611121 is a `hidden beast` number, since 2 + 1 + 6 + 24 + 611 + 1 + 21 = 666.
It is not a de Polignac number, because 21624611121 - 222 = 21620416817 is a prime.
It is a super-2 number, since 2×216246111212 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 800911523 = 21624611121 / (2 + 1 + 6 + 2 + 4 + 6 + 1 + 1 + 1 + 2 + 1).
It is not an unprimeable number, because it can be changed into a prime (21624611191) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 400455735 + ... + 400455788.
It is an arithmetic number, because the mean of its divisors is an integer number (4004557620).
Almost surely, 221624611121 is an apocalyptic number.
It is an amenable number.
21624611121 is a deficient number, since it is larger than the sum of its proper divisors (10411849839).
21624611121 is an equidigital number, since it uses as much as digits as its factorization.
21624611121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 800911532 (or 800911526 counting only the distinct ones).
The product of its digits is 1152, while the sum is 27.
The spelling of 21624611121 in words is "twenty-one billion, six hundred twenty-four million, six hundred eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •