Base | Representation |
---|---|
bin | 10011000001010010… |
… | …00001111110001101 |
3 | 222100122100221202212 |
4 | 21200221001332031 |
5 | 131403043201214 |
6 | 4405131400205 |
7 | 511021434404 |
oct | 114051017615 |
9 | 28318327685 |
10 | 10211303309 |
11 | 4370018349 |
12 | 1b8b8b3065 |
13 | c6970160c |
14 | 6cc24863b |
15 | 3eb6eb53e |
hex | 260a41f8d |
10211303309 has 2 divisors, whose sum is σ = 10211303310. Its totient is φ = 10211303308.
The previous prime is 10211303269. The next prime is 10211303321. The reversal of 10211303309 is 90330311201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6654970084 + 3556333225 = 81578^2 + 59635^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10211303309 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10211303359) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5105651654 + 5105651655.
It is an arithmetic number, because the mean of its divisors is an integer number (5105651655).
Almost surely, 210211303309 is an apocalyptic number.
It is an amenable number.
10211303309 is a deficient number, since it is larger than the sum of its proper divisors (1).
10211303309 is an equidigital number, since it uses as much as digits as its factorization.
10211303309 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 23.
The spelling of 10211303309 in words is "ten billion, two hundred eleven million, three hundred three thousand, three hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •