Base | Representation |
---|---|
bin | 10010010001001… |
… | …00110110010111 |
3 | 101200100112220211 |
4 | 21020210312113 |
5 | 303212234111 |
6 | 23112310251 |
7 | 3540354454 |
oct | 1110446627 |
9 | 350315824 |
10 | 153243031 |
11 | 79557837 |
12 | 433a2387 |
13 | 25996066 |
14 | 164d082b |
15 | d6c0521 |
hex | 9224d97 |
153243031 has 2 divisors, whose sum is σ = 153243032. Its totient is φ = 153243030.
The previous prime is 153243019. The next prime is 153243061. The reversal of 153243031 is 130342351.
It is a weak prime.
It is an emirp because it is prime and its reverse (130342351) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 153243031 - 213 = 153234839 is a prime.
It is a super-2 number, since 2×1532430312 = 46966853100133922, which contains 22 as substring.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 153242993 and 153243011.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (153243061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 76621515 + 76621516.
It is an arithmetic number, because the mean of its divisors is an integer number (76621516).
Almost surely, 2153243031 is an apocalyptic number.
153243031 is a deficient number, since it is larger than the sum of its proper divisors (1).
153243031 is an equidigital number, since it uses as much as digits as its factorization.
153243031 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 153243031 is about 12379.1369246810. The cubic root of 153243031 is about 535.1311653242.
Adding to 153243031 its reverse (130342351), we get a palindrome (283585382).
The spelling of 153243031 in words is "one hundred fifty-three million, two hundred forty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •