Base | Representation |
---|---|
bin | 10010101000011110… |
… | …10011010111010001 |
3 | 221211010211211212211 |
4 | 21110033103113101 |
5 | 130441311412314 |
6 | 4332335552121 |
7 | 502614033205 |
oct | 112417232721 |
9 | 27733754784 |
10 | 10003232209 |
11 | 4273622463 |
12 | 1b3208b641 |
13 | c3557c719 |
14 | 6ac764b05 |
15 | 3d82ea9c4 |
hex | 2543d35d1 |
10003232209 has 2 divisors, whose sum is σ = 10003232210. Its totient is φ = 10003232208.
The previous prime is 10003232207. The next prime is 10003232269. The reversal of 10003232209 is 90223230001.
10003232209 is digitally balanced in base 2, because in such base 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., 6984279184 + 3018953025 = 83572^2 + 54945^2 .
It is a cyclic number.
It is not a de Polignac number, because 10003232209 - 21 = 10003232207 is a prime.
Together with 10003232207, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 10003232209.
It is not a weakly prime, because it can be changed into another prime (10003232207) 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, 5001616104 + 5001616105.
It is an arithmetic number, because the mean of its divisors is an integer number (5001616105).
Almost surely, 210003232209 is an apocalyptic number.
It is an amenable number.
10003232209 is a deficient number, since it is larger than the sum of its proper divisors (1).
10003232209 is an equidigital number, since it uses as much as digits as its factorization.
10003232209 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 22.
The spelling of 10003232209 in words is "ten billion, three million, two hundred thirty-two thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •