Base | Representation |
---|---|
bin | 1001000110000100111010… |
… | …0101111101000010111101 |
3 | 1022101222202100211002012002 |
4 | 2101201032211331002331 |
5 | 2302320001110443214 |
6 | 33133534313152045 |
7 | 2051322245145203 |
oct | 221411645750275 |
9 | 38358670732162 |
10 | 10000002437309 |
11 | 3205a82749225 |
12 | 11560986bb625 |
13 | 576cc47cca11 |
14 | 2680075a5073 |
15 | 1251ca2751de |
hex | 9184e97d0bd |
10000002437309 has 2 divisors, whose sum is σ = 10000002437310. Its totient is φ = 10000002437308.
The previous prime is 10000002437267. The next prime is 10000002437323. The reversal of 10000002437309 is 90373420000001.
10000002437309 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 can be written as a sum of positive squares in only one way, i.e., 6379438320025 + 3620564117284 = 2525755^2 + 1902778^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10000002437309 is a prime.
It is a super-2 number, since 2×100000024373092 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10000002437339) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5000001218654 + 5000001218655.
It is an arithmetic number, because the mean of its divisors is an integer number (5000001218655).
Almost surely, 210000002437309 is an apocalyptic number.
It is an amenable number.
10000002437309 is a deficient number, since it is larger than the sum of its proper divisors (1).
10000002437309 is an equidigital number, since it uses as much as digits as its factorization.
10000002437309 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4536, while the sum is 29.
The spelling of 10000002437309 in words is "ten trillion, two million, four hundred thirty-seven thousand, three hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •