Base | Representation |
---|---|
bin | 10011000000011100… |
… | …11100001111100111 |
3 | 222100011020211100102 |
4 | 21200032130033213 |
5 | 131344302124111 |
6 | 4404322134315 |
7 | 510605254034 |
oct | 114016341747 |
9 | 28304224312 |
10 | 10204333031 |
11 | 4367097492 |
12 | 1b894b139b |
13 | c68130aa9 |
14 | 6cb35238b |
15 | 3eacc113b |
hex | 26039c3e7 |
10204333031 has 2 divisors, whose sum is σ = 10204333032. Its totient is φ = 10204333030.
The previous prime is 10204333001. The next prime is 10204333049. The reversal of 10204333031 is 13033340201.
10204333031 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10204333031 - 230 = 9130591207 is a prime.
It is a super-2 number, since 2×102043330312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10204332994 and 10204333012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10204333001) 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, 5102166515 + 5102166516.
It is an arithmetic number, because the mean of its divisors is an integer number (5102166516).
Almost surely, 210204333031 is an apocalyptic number.
10204333031 is a deficient number, since it is larger than the sum of its proper divisors (1).
10204333031 is an equidigital number, since it uses as much as digits as its factorization.
10204333031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 10204333031 its reverse (13033340201), we get a palindrome (23237673232).
The spelling of 10204333031 in words is "ten billion, two hundred four million, three hundred thirty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •