Base | Representation |
---|---|
bin | 1111000110101010000011… |
… | …0110001110100101011101 |
3 | 2011210121200022122110021222 |
4 | 3301222200312032211131 |
5 | 4134042210241331123 |
6 | 55153100403503125 |
7 | 3332550662026451 |
oct | 361524066164535 |
9 | 64717608573258 |
10 | 16607042136413 |
11 | 5323009383313 |
12 | 1a42680987aa5 |
13 | 9360640b2831 |
14 | 415adc56a661 |
15 | 1dbec20d76c8 |
hex | f1aa0d8e95d |
16607042136413 has 4 divisors (see below), whose sum is σ = 16607067103200. Its totient is φ = 16607017169628.
The previous prime is 16607042136407. The next prime is 16607042136473. The reversal of 16607042136413 is 31463124070661.
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 16607042136413 - 222 = 16607037942109 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16607042136403) 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 3 ways as a sum of consecutive naturals, for example, 11457545 + ... + 12825342.
It is an arithmetic number, because the mean of its divisors is an integer number (4151766775800).
Almost surely, 216607042136413 is an apocalyptic number.
It is an amenable number.
16607042136413 is a deficient number, since it is larger than the sum of its proper divisors (24966787).
16607042136413 is an equidigital number, since it uses as much as digits as its factorization.
16607042136413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24966786.
The product of its (nonzero) digits is 435456, while the sum is 44.
The spelling of 16607042136413 in words is "sixteen trillion, six hundred seven billion, forty-two million, one hundred thirty-six thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •