Base | Representation |
---|---|
bin | 11110101001110011… |
… | …00111001000001001 |
3 | 1120110220022202010211 |
4 | 33110321213020021 |
5 | 232200413233103 |
6 | 11320553441121 |
7 | 1121546162251 |
oct | 172471471011 |
9 | 46426282124 |
10 | 16456774153 |
11 | 6a85468aa6 |
12 | 32334101a1 |
13 | 17235b53b1 |
14 | b218b4961 |
15 | 664b7136d |
hex | 3d4e67209 |
16456774153 has 2 divisors, whose sum is σ = 16456774154. Its totient is φ = 16456774152.
The previous prime is 16456774141. The next prime is 16456774211. The reversal of 16456774153 is 35147765461.
It is a happy number.
16456774153 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., 9111084304 + 7345689849 = 95452^2 + 85707^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-16456774153 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 16456774097 and 16456774106.
It is not a weakly prime, because it can be changed into another prime (16456774253) 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, 8228387076 + 8228387077.
It is an arithmetic number, because the mean of its divisors is an integer number (8228387077).
Almost surely, 216456774153 is an apocalyptic number.
It is an amenable number.
16456774153 is a deficient number, since it is larger than the sum of its proper divisors (1).
16456774153 is an equidigital number, since it uses as much as digits as its factorization.
16456774153 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2116800, while the sum is 49.
The spelling of 16456774153 in words is "sixteen billion, four hundred fifty-six million, seven hundred seventy-four thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •