Base | Representation |
---|---|
bin | 110100101001100001001011… |
… | …111100100010100010011011 |
3 | 1010100212010000201022021022211 |
4 | 310221201023330202202123 |
5 | 220322220034030221014 |
6 | 2140245151455455551 |
7 | 66526022202062035 |
oct | 6451411374424233 |
9 | 1110763021267284 |
10 | 231551551023259 |
11 | 6786350901a545 |
12 | 21b782a9b275b7 |
13 | 9c282a9ccc78c |
14 | 4127224d52c55 |
15 | 1bb82c1d2ecc4 |
hex | d2984bf2289b |
231551551023259 has 2 divisors, whose sum is σ = 231551551023260. Its totient is φ = 231551551023258.
The previous prime is 231551551023257. The next prime is 231551551023329. The reversal of 231551551023259 is 952320155155132.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 231551551023259 - 21 = 231551551023257 is a prime.
It is a super-2 number, since 2×2315515510232592 (a number of 30 digits) contains 22 as substring.
Together with 231551551023257, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (231551551023257) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 115775775511629 + 115775775511630.
It is an arithmetic number, because the mean of its divisors is an integer number (115775775511630).
Almost surely, 2231551551023259 is an apocalyptic number.
231551551023259 is a deficient number, since it is larger than the sum of its proper divisors (1).
231551551023259 is an equidigital number, since it uses as much as digits as its factorization.
231551551023259 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2025000, while the sum is 49.
The spelling of 231551551023259 in words is "two hundred thirty-one trillion, five hundred fifty-one billion, five hundred fifty-one million, twenty-three thousand, two hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •