Base | Representation |
---|---|
bin | 1110100100010000110011… |
… | …0001000110101111101001 |
3 | 2002201010110211122220010212 |
4 | 3221010030301012233221 |
5 | 4044402032143333212 |
6 | 54021414431350505 |
7 | 3242062026235550 |
oct | 351041461065751 |
9 | 62633424586125 |
10 | 16016147246057 |
11 | 5115456642422 |
12 | 1968053382435 |
13 | 8c2415917a8a |
14 | 3d528565cd97 |
15 | 1cb93b7a9e22 |
hex | e910cc46be9 |
16016147246057 has 4 divisors (see below), whose sum is σ = 18304168281216. Its totient is φ = 13728126210900.
The previous prime is 16016147246017. The next prime is 16016147246107. The reversal of 16016147246057 is 75064274161061.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 16016147246057 - 28 = 16016147245801 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 16016147245996 and 16016147246014.
It is not an unprimeable number, because it can be changed into a prime (16016147246017) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1144010517569 + ... + 1144010517582.
It is an arithmetic number, because the mean of its divisors is an integer number (4576042070304).
Almost surely, 216016147246057 is an apocalyptic number.
It is an amenable number.
16016147246057 is a deficient number, since it is larger than the sum of its proper divisors (2288021035159).
16016147246057 is an equidigital number, since it uses as much as digits as its factorization.
16016147246057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2288021035158.
The product of its (nonzero) digits is 1693440, while the sum is 50.
The spelling of 16016147246057 in words is "sixteen trillion, sixteen billion, one hundred forty-seven million, two hundred forty-six thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •