Base | Representation |
---|---|
bin | 10011001101010011… |
… | …00101010011100011 |
3 | 222121200001112101022 |
4 | 21212221211103203 |
5 | 132104400030311 |
6 | 4423132200055 |
7 | 513354333344 |
oct | 114651452343 |
9 | 28550045338 |
10 | 10312111331 |
11 | 4411a10965 |
12 | 1bb960902b |
13 | c84568b32 |
14 | 6db7aa0cb |
15 | 4054b05db |
hex | 266a654e3 |
10312111331 has 2 divisors, whose sum is σ = 10312111332. Its totient is φ = 10312111330.
The previous prime is 10312111301. The next prime is 10312111361. The reversal of 10312111331 is 13311121301.
10312111331 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a balanced prime because it is at equal distance from previous prime (10312111301) and next prime (10312111361).
It is a cyclic number.
It is not a de Polignac number, because 10312111331 - 230 = 9238369507 is a prime.
It is a super-2 number, since 2×103121113312 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10312111301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5156055665 + 5156055666.
It is an arithmetic number, because the mean of its divisors is an integer number (5156055666).
Almost surely, 210312111331 is an apocalyptic number.
10312111331 is a deficient number, since it is larger than the sum of its proper divisors (1).
10312111331 is an equidigital number, since it uses as much as digits as its factorization.
10312111331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 10312111331 its reverse (13311121301), we get a palindrome (23623232632).
The spelling of 10312111331 in words is "ten billion, three hundred twelve million, one hundred eleven thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •