Base | Representation |
---|---|
bin | 100010110110111111001000… |
… | …000111100001000010000111 |
3 | 202002211111121212102122012101 |
4 | 202312333020013201002013 |
5 | 130043331404022403411 |
6 | 1302022354223332531 |
7 | 44202304416123025 |
oct | 4266771007410207 |
9 | 662744555378171 |
10 | 153312215044231 |
11 | 44939388607811 |
12 | 15240b26751147 |
13 | 6771383a83029 |
14 | 29c04ca84d715 |
15 | 12ad0088ce8c1 |
hex | 8b6fc81e1087 |
153312215044231 has 2 divisors, whose sum is σ = 153312215044232. Its totient is φ = 153312215044230.
The previous prime is 153312215044181. The next prime is 153312215044237. The reversal of 153312215044231 is 132440512213351.
It is a strong prime.
It is an emirp because it is prime and its reverse (132440512213351) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 153312215044231 - 215 = 153312215011463 is a prime.
It is a super-2 number, since 2×1533122150442312 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (153312215044237) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 76656107522115 + 76656107522116.
It is an arithmetic number, because the mean of its divisors is an integer number (76656107522116).
Almost surely, 2153312215044231 is an apocalyptic number.
153312215044231 is a deficient number, since it is larger than the sum of its proper divisors (1).
153312215044231 is an equidigital number, since it uses as much as digits as its factorization.
153312215044231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 86400, while the sum is 37.
Adding to 153312215044231 its reverse (132440512213351), we get a palindrome (285752727257582).
The spelling of 153312215044231 in words is "one hundred fifty-three trillion, three hundred twelve billion, two hundred fifteen million, forty-four thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •