Base | Representation |
---|---|
bin | 1001100111110101110100… |
… | …10101100110011001111001 |
3 | 2202220220000012101010020120 |
4 | 10303322322111212121321 |
5 | 10233141424042441401 |
6 | 113000455404043453 |
7 | 4312524605620254 |
oct | 463727225463171 |
9 | 82826005333216 |
10 | 21160135124601 |
11 | 6818a656a8210 |
12 | 2458b86533589 |
13 | ba651380a375 |
14 | 53222811009b |
15 | 26a654d7b836 |
hex | 133eba566679 |
21160135124601 has 8 divisors (see below), whose sum is σ = 30778378363104. Its totient is φ = 12824324317920.
The previous prime is 21160135124591. The next prime is 21160135124641. The reversal of 21160135124601 is 10642153106112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 21160135124601 - 27 = 21160135124473 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33), and also a Moran number because the ratio is a prime number: 641216215897 = 21160135124601 / (2 + 1 + 1 + 6 + 0 + 1 + 3 + 5 + 1 + 2 + 4 + 6 + 0 + 1).
It is not an unprimeable number, because it can be changed into a prime (21160135124641) 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, 320608107916 + ... + 320608107981.
It is an arithmetic number, because the mean of its divisors is an integer number (3847297295388).
Almost surely, 221160135124601 is an apocalyptic number.
It is an amenable number.
21160135124601 is a deficient number, since it is larger than the sum of its proper divisors (9618243238503).
21160135124601 is a wasteful number, since it uses less digits than its factorization.
21160135124601 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 641216215911.
The product of its (nonzero) digits is 8640, while the sum is 33.
The spelling of 21160135124601 in words is "twenty-one trillion, one hundred sixty billion, one hundred thirty-five million, one hundred twenty-four thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •