Base | Representation |
---|---|
bin | 1001101011101000101000… |
… | …0111111110011101101001 |
3 | 1101200200020111222210220101 |
4 | 2122322022013332131221 |
5 | 2343402431023244103 |
6 | 34350205244425401 |
7 | 2146044061426324 |
oct | 232721207763551 |
9 | 41620214883811 |
10 | 10645246306153 |
11 | 3434695023068 |
12 | 123b153548261 |
13 | 5c2ac4a45144 |
14 | 28b3386397bb |
15 | 136d92153a1d |
hex | 9ae8a1fe769 |
10645246306153 has 2 divisors, whose sum is σ = 10645246306154. Its totient is φ = 10645246306152.
The previous prime is 10645246306141. The next prime is 10645246306159. The reversal of 10645246306153 is 35160364254601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9176101107264 + 1469145198889 = 3029208^2 + 1212083^2 .
It is an emirp because it is prime and its reverse (35160364254601) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10645246306153 is a prime.
It is a super-2 number, since 2×106452463061532 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10645246306159) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5322623153076 + 5322623153077.
It is an arithmetic number, because the mean of its divisors is an integer number (5322623153077).
Almost surely, 210645246306153 is an apocalyptic number.
It is an amenable number.
10645246306153 is a deficient number, since it is larger than the sum of its proper divisors (1).
10645246306153 is an equidigital number, since it uses as much as digits as its factorization.
10645246306153 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1555200, while the sum is 46.
The spelling of 10645246306153 in words is "ten trillion, six hundred forty-five billion, two hundred forty-six million, three hundred six thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •