Base | Representation |
---|---|
bin | 10010001111100… |
… | …01001011111111 |
3 | 101122221210122111 |
4 | 21013301023333 |
5 | 303134001143 |
6 | 23103554451 |
7 | 3535513516 |
oct | 1107611377 |
9 | 348853574 |
10 | 153031423 |
11 | 79422856 |
12 | 432bba27 |
13 | 2592094c |
14 | 1647767d |
15 | d67c99d |
hex | 91f12ff |
153031423 has 2 divisors, whose sum is σ = 153031424. Its totient is φ = 153031422.
The previous prime is 153031391. The next prime is 153031447. The reversal of 153031423 is 324130351.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 153031423 - 25 = 153031391 is a prime.
It is equal to p8605111 and since 153031423 and 8605111 have the same sum of digits, it is a Honaker prime.
It is a junction number, because it is equal to n+sod(n) for n = 153031394 and 153031403.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (153031523) 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, 76515711 + 76515712.
It is an arithmetic number, because the mean of its divisors is an integer number (76515712).
Almost surely, 2153031423 is an apocalyptic number.
153031423 is a deficient number, since it is larger than the sum of its proper divisors (1).
153031423 is an equidigital number, since it uses as much as digits as its factorization.
153031423 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1080, while the sum is 22.
The square root of 153031423 is about 12370.5870111325. The cubic root of 153031423 is about 534.8847371570.
Adding to 153031423 its reverse (324130351), we get a palindrome (477161774).
The spelling of 153031423 in words is "one hundred fifty-three million, thirty-one thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •