Base | Representation |
---|---|
bin | 11110101010000000… |
… | …01100011111010101 |
3 | 1120111000120102122001 |
4 | 33111000030133111 |
5 | 232201334000203 |
6 | 11321054435301 |
7 | 1121566641112 |
oct | 172500143725 |
9 | 46430512561 |
10 | 16458500053 |
11 | 6a86437766 |
12 | 3233b02b31 |
13 | 1723a6ab38 |
14 | b21c03909 |
15 | 664db291d |
hex | 3d500c7d5 |
16458500053 has 2 divisors, whose sum is σ = 16458500054. Its totient is φ = 16458500052.
The previous prime is 16458500033. The next prime is 16458500083. The reversal of 16458500053 is 35000585461.
16458500053 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13052377009 + 3406123044 = 114247^2 + 58362^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-16458500053 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 16458499985 and 16458500021.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (16458500033) 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 as a sum of consecutive naturals, namely, 8229250026 + 8229250027.
It is an arithmetic number, because the mean of its divisors is an integer number (8229250027).
Almost surely, 216458500053 is an apocalyptic number.
It is an amenable number.
16458500053 is a deficient number, since it is larger than the sum of its proper divisors (1).
16458500053 is an equidigital number, since it uses as much as digits as its factorization.
16458500053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72000, while the sum is 37.
The spelling of 16458500053 in words is "sixteen billion, four hundred fifty-eight million, five hundred thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •