Base | Representation |
---|---|
bin | 110100100101111001000100… |
… | …111011001011010000000011 |
3 | 1010022222021201201210201010012 |
4 | 310211321010323023100003 |
5 | 220304124130212401201 |
6 | 2135534453215455135 |
7 | 66502020145631051 |
oct | 6445710473132003 |
9 | 1108867651721105 |
10 | 231302325122051 |
11 | 67777846546167 |
12 | 21b37b348274ab |
13 | 9c0a93c425311 |
14 | 41191412871d1 |
15 | 1bb1a86e735bb |
hex | d25e44ecb403 |
231302325122051 has 2 divisors, whose sum is σ = 231302325122052. Its totient is φ = 231302325122050.
The previous prime is 231302325122047. The next prime is 231302325122053. The reversal of 231302325122051 is 150221523203132.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 231302325122051 - 22 = 231302325122047 is a prime.
Together with 231302325122053, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 231302325121999 and 231302325122017.
It is not a weakly prime, because it can be changed into another prime (231302325122053) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 115651162561025 + 115651162561026.
It is an arithmetic number, because the mean of its divisors is an integer number (115651162561026).
Almost surely, 2231302325122051 is an apocalyptic number.
231302325122051 is a deficient number, since it is larger than the sum of its proper divisors (1).
231302325122051 is an equidigital number, since it uses as much as digits as its factorization.
231302325122051 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 21600, while the sum is 32.
Adding to 231302325122051 its reverse (150221523203132), we get a palindrome (381523848325183).
The spelling of 231302325122051 in words is "two hundred thirty-one trillion, three hundred two billion, three hundred twenty-five million, one hundred twenty-two thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •