Base | Representation |
---|---|
bin | 11111011100100000101… |
… | …111111000010010101000 |
3 | 21122120201002101211000000 |
4 | 133130200233320102220 |
5 | 240401030000102021 |
6 | 4332413443343000 |
7 | 312056363461620 |
oct | 37344057702250 |
9 | 7576632354000 |
10 | 2160917972136 |
11 | 763492951000 |
12 | 2aa973081a60 |
13 | 128a09a4aa71 |
14 | 7683627b880 |
15 | 3b325346b26 |
hex | 1f720bf84a8 |
2160917972136 has 448 divisors, whose sum is σ = 7636565404800. Its totient is φ = 561263281920.
The previous prime is 2160917972123. The next prime is 2160917972137. The reversal of 2160917972136 is 6312797190612.
2160917972136 is a `hidden beast` number, since 2 + 1 + 609 + 1 + 7 + 9 + 7 + 21 + 3 + 6 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is not an unprimeable number, because it can be changed into a prime (2160917972137) by changing a digit.
It is a polite number, since it can be written in 111 ways as a sum of consecutive naturals, for example, 54316860 + ... + 54356628.
Almost surely, 22160917972136 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 2160917972136, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3818282702400).
2160917972136 is an abundant number, since it is smaller than the sum of its proper divisors (5475647432664).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2160917972136 is an equidigital number, since it uses as much as digits as its factorization.
2160917972136 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39833 (or 39792 counting only the distinct ones).
The product of its (nonzero) digits is 1714608, while the sum is 54.
The spelling of 2160917972136 in words is "two trillion, one hundred sixty billion, nine hundred seventeen million, nine hundred seventy-two thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •