Base | Representation |
---|---|
bin | 10010101011110100… |
… | …00000001111101101 |
3 | 221220002110221000111 |
4 | 21111322000033231 |
5 | 131020442001214 |
6 | 4335215300021 |
7 | 503403551461 |
oct | 112572001755 |
9 | 27802427014 |
10 | 10031203309 |
11 | 4288397576 |
12 | 1b3b51a611 |
13 | c3b2c407a |
14 | 6b23664a1 |
15 | 3da9c35c4 |
hex | 255e803ed |
10031203309 has 2 divisors, whose sum is σ = 10031203310. Its totient is φ = 10031203308.
The previous prime is 10031203297. The next prime is 10031203337. The reversal of 10031203309 is 90330213001.
10031203309 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8647140100 + 1384063209 = 92990^2 + 37203^2 .
It is a cyclic number.
It is not a de Polignac number, because 10031203309 - 27 = 10031203181 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10031203309.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10031207309) 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, 5015601654 + 5015601655.
It is an arithmetic number, because the mean of its divisors is an integer number (5015601655).
Almost surely, 210031203309 is an apocalyptic number.
It is an amenable number.
10031203309 is a deficient number, since it is larger than the sum of its proper divisors (1).
10031203309 is an equidigital number, since it uses as much as digits as its factorization.
10031203309 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.
The spelling of 10031203309 in words is "ten billion, thirty-one million, two hundred three thousand, three hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •