Base | Representation |
---|---|
bin | 1110100110100110000100… |
… | …0001100100000011001001 |
3 | 2002211221220021020202001112 |
4 | 3221221201001210003021 |
5 | 4101031112140132301 |
6 | 54052042410300105 |
7 | 3245010663226616 |
oct | 351514101440311 |
9 | 62757807222045 |
10 | 16056215552201 |
11 | 5130448104920 |
12 | 1973976127635 |
13 | 8c612cb94b76 |
14 | 3d71a6d2b50d |
15 | 1cc9d42859bb |
hex | e9a610640c9 |
16056215552201 has 8 divisors (see below), whose sum is σ = 17726906109024. Its totient is φ = 14420697428320.
The previous prime is 16056215552183. The next prime is 16056215552249. The reversal of 16056215552201 is 10225551265061.
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 16056215552201 - 26 = 16056215552137 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (16056215552501) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8793107276 + ... + 8793109101.
It is an arithmetic number, because the mean of its divisors is an integer number (2215863263628).
Almost surely, 216056215552201 is an apocalyptic number.
16056215552201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
16056215552201 is a deficient number, since it is larger than the sum of its proper divisors (1670690556823).
16056215552201 is a wasteful number, since it uses less digits than its factorization.
16056215552201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17586216471.
The product of its (nonzero) digits is 180000, while the sum is 41.
The spelling of 16056215552201 in words is "sixteen trillion, fifty-six billion, two hundred fifteen million, five hundred fifty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.029 sec. • engine limits •