Base | Representation |
---|---|
bin | 1001101011101010000100… |
… | …1000110011111001110001 |
3 | 1101200201020102111110110212 |
4 | 2122322201020303321301 |
5 | 2343404223343313014 |
6 | 34350311440033505 |
7 | 2146056460245314 |
oct | 232724110637161 |
9 | 41621212443425 |
10 | 10645632401009 |
11 | 3434872a60921 |
12 | 123b240902895 |
13 | 5c2b56a28538 |
14 | 28b373a2097b |
15 | 136db5ebc23e |
hex | 9aea1233e71 |
10645632401009 has 2 divisors, whose sum is σ = 10645632401010. Its totient is φ = 10645632401008.
The previous prime is 10645632400993. The next prime is 10645632401023. The reversal of 10645632401009 is 90010423654601.
10645632401009 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., 8546103850384 + 2099528550625 = 2923372^2 + 1448975^2 .
It is a cyclic number.
It is not a de Polignac number, because 10645632401009 - 24 = 10645632400993 is a prime.
It is a super-2 number, since 2×106456324010092 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10645632401039) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5322816200504 + 5322816200505.
It is an arithmetic number, because the mean of its divisors is an integer number (5322816200505).
Almost surely, 210645632401009 is an apocalyptic number.
It is an amenable number.
10645632401009 is a deficient number, since it is larger than the sum of its proper divisors (1).
10645632401009 is an equidigital number, since it uses as much as digits as its factorization.
10645632401009 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 155520, while the sum is 41.
The spelling of 10645632401009 in words is "ten trillion, six hundred forty-five billion, six hundred thirty-two million, four hundred one thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •