Base | Representation |
---|---|
bin | 1110101100101011001000… |
… | …1010011101110100110001 |
3 | 2010012221110220111000211010 |
4 | 3223022302022131310301 |
5 | 4104234010422234401 |
6 | 54212034120541133 |
7 | 3255366056656311 |
oct | 353126212356461 |
9 | 63187426430733 |
10 | 16160656055601 |
11 | 5170772043942 |
12 | 19900630217a9 |
13 | 902c356492c5 |
14 | 3dc273a0b441 |
15 | 1d0598259ed6 |
hex | eb2b229dd31 |
16160656055601 has 8 divisors (see below), whose sum is σ = 21547573563904. Its totient is φ = 10773754625520.
The previous prime is 16160656055587. The next prime is 16160656055603. The reversal of 16160656055601 is 10655065606161.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 16160656055601 - 214 = 16160656039217 is a prime.
It is a super-2 number, since 2×161606560556012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (16160656055603) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1437265 + ... + 5864046.
It is an arithmetic number, because the mean of its divisors is an integer number (2693446695488).
Almost surely, 216160656055601 is an apocalyptic number.
It is an amenable number.
16160656055601 is a deficient number, since it is larger than the sum of its proper divisors (5386917508303).
16160656055601 is an equidigital number, since it uses as much as digits as its factorization.
16160656055601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8039111.
The product of its (nonzero) digits is 972000, while the sum is 48.
The spelling of 16160656055601 in words is "sixteen trillion, one hundred sixty billion, six hundred fifty-six million, fifty-five thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •