Base | Representation |
---|---|
bin | 10011101010001110… |
… | …101110111100100101 |
3 | 2000111011102210100102 |
4 | 103222032232330211 |
5 | 321213024200122 |
6 | 13410403553445 |
7 | 1345054432301 |
oct | 235216567445 |
9 | 60434383312 |
10 | 21109600037 |
11 | 8a52900a49 |
12 | 411168b885 |
13 | 1cb553a0c6 |
14 | 1043802d01 |
15 | 83839b492 |
hex | 4ea3aef25 |
21109600037 has 8 divisors (see below), whose sum is σ = 21458087160. Its totient is φ = 20761191360.
The previous prime is 21109600027. The next prime is 21109600093. The reversal of 21109600037 is 73000690112.
It can be written as a sum of positive squares in 4 ways, for example, as 2938290436 + 18171309601 = 54206^2 + 134801^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 21109600037 - 214 = 21109583653 is a prime.
It is a super-2 number, since 2×211096000372 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21109599982 and 21109600009.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21109600027) 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, 808763 + ... + 834455.
It is an arithmetic number, because the mean of its divisors is an integer number (2682260895).
Almost surely, 221109600037 is an apocalyptic number.
It is an amenable number.
21109600037 is a deficient number, since it is larger than the sum of its proper divisors (348487123).
21109600037 is a wasteful number, since it uses less digits than its factorization.
21109600037 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 39223.
The product of its (nonzero) digits is 2268, while the sum is 29.
The spelling of 21109600037 in words is "twenty-one billion, one hundred nine million, six hundred thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •