Base | Representation |
---|---|
bin | 1000111011101001010… |
… | …0000001011001100011 |
3 | 112200002011121201012102 |
4 | 2032322110001121203 |
5 | 10003231103304042 |
6 | 154254354521015 |
7 | 14041424432651 |
oct | 2167224013143 |
9 | 480064551172 |
10 | 153449666147 |
11 | 5a094377408 |
12 | 258a5b9616b |
13 | 1161617472b |
14 | 75d99a9dd1 |
15 | 3ed1897b32 |
hex | 23ba501663 |
153449666147 has 2 divisors, whose sum is σ = 153449666148. Its totient is φ = 153449666146.
The previous prime is 153449666131. The next prime is 153449666189. The reversal of 153449666147 is 741666944351.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 153449666147 - 24 = 153449666131 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 153449666092 and 153449666101.
It is not a weakly prime, because it can be changed into another prime (153449666947) 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, 76724833073 + 76724833074.
It is an arithmetic number, because the mean of its divisors is an integer number (76724833074).
Almost surely, 2153449666147 is an apocalyptic number.
153449666147 is a deficient number, since it is larger than the sum of its proper divisors (1).
153449666147 is an equidigital number, since it uses as much as digits as its factorization.
153449666147 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 13063680, while the sum is 56.
The spelling of 153449666147 in words is "one hundred fifty-three billion, four hundred forty-nine million, six hundred sixty-six thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •