Base | Representation |
---|---|
bin | 110100100101111001110011… |
… | …000111001001101011111111 |
3 | 1010022222100201201220021002111 |
4 | 310211321303013021223333 |
5 | 220304132222100411221 |
6 | 2135535102140234451 |
7 | 66502045305250204 |
oct | 6445716307115377 |
9 | 1108870651807074 |
10 | 231303100013311 |
11 | 67778103997467 |
12 | 21b3811023ba27 |
13 | 9c0aa33b26661 |
14 | 41191b6157cab |
15 | 1bb1aceedabe1 |
hex | d25e731c9aff |
231303100013311 has 2 divisors, whose sum is σ = 231303100013312. Its totient is φ = 231303100013310.
The previous prime is 231303100013267. The next prime is 231303100013327. The reversal of 231303100013311 is 113310001303132.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 231303100013311 - 213 = 231303100005119 is a prime.
It is a super-2 number, since 2×2313031000133112 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (231303100013371) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 115651550006655 + 115651550006656.
It is an arithmetic number, because the mean of its divisors is an integer number (115651550006656).
Almost surely, 2231303100013311 is an apocalyptic number.
231303100013311 is a deficient number, since it is larger than the sum of its proper divisors (1).
231303100013311 is an equidigital number, since it uses as much as digits as its factorization.
231303100013311 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 231303100013311 its reverse (113310001303132), we get a palindrome (344613101316443).
The spelling of 231303100013311 in words is "two hundred thirty-one trillion, three hundred three billion, one hundred million, thirteen thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •