Base | Representation |
---|---|
bin | 1001010111101010011110… |
… | …0100110100110001010001 |
3 | 1100110212122001122012010111 |
4 | 2111322213210310301101 |
5 | 2322242242103233314 |
6 | 33524423354401321 |
7 | 2112206464565641 |
oct | 225724744646121 |
9 | 40425561565114 |
10 | 10302143024209 |
11 | 3312129185103 |
12 | 11a475aa30241 |
13 | 599645c5a19a |
14 | 2788aab1a521 |
15 | 12ceb0816ec4 |
hex | 95ea7934c51 |
10302143024209 has 2 divisors, whose sum is σ = 10302143024210. Its totient is φ = 10302143024208.
The previous prime is 10302143024153. The next prime is 10302143024287. The reversal of 10302143024209 is 90242034120301.
10302143024209 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., 6749068822609 + 3553074201600 = 2597897^2 + 1884960^2 .
It is a cyclic number.
It is not a de Polignac number, because 10302143024209 - 213 = 10302143016017 is a prime.
It is a super-2 number, since 2×103021430242092 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10302143024809) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5151071512104 + 5151071512105.
It is an arithmetic number, because the mean of its divisors is an integer number (5151071512105).
Almost surely, 210302143024209 is an apocalyptic number.
It is an amenable number.
10302143024209 is a deficient number, since it is larger than the sum of its proper divisors (1).
10302143024209 is an equidigital number, since it uses as much as digits as its factorization.
10302143024209 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 10368, while the sum is 31.
The spelling of 10302143024209 in words is "ten trillion, three hundred two billion, one hundred forty-three million, twenty-four thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •