Base | Representation |
---|---|
bin | 10011001111101110… |
… | …00110101010000111 |
3 | 222200002021222111212 |
4 | 21213313012222013 |
5 | 132130100324111 |
6 | 4425135522035 |
7 | 514022142314 |
oct | 114767065207 |
9 | 28602258455 |
10 | 10332433031 |
11 | 4422430958 |
12 | 200438931b |
13 | c888327cb |
14 | 700379d0b |
15 | 40717698b |
hex | 267dc6a87 |
10332433031 has 2 divisors, whose sum is σ = 10332433032. Its totient is φ = 10332433030.
The previous prime is 10332432973. The next prime is 10332433057. The reversal of 10332433031 is 13033423301.
It is a strong prime.
It is an emirp because it is prime and its reverse (13033423301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10332433031 - 218 = 10332170887 is a prime.
It is a super-2 number, since 2×103324330312 (a number of 21 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 10332432988 and 10332433006.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10332433081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5166216515 + 5166216516.
It is an arithmetic number, because the mean of its divisors is an integer number (5166216516).
Almost surely, 210332433031 is an apocalyptic number.
10332433031 is a deficient number, since it is larger than the sum of its proper divisors (1).
10332433031 is an equidigital number, since it uses as much as digits as its factorization.
10332433031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1944, while the sum is 23.
Adding to 10332433031 its reverse (13033423301), we get a palindrome (23365856332).
The spelling of 10332433031 in words is "ten billion, three hundred thirty-two million, four hundred thirty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •