Base | Representation |
---|---|
bin | 1001101011101010000100… |
… | …1000110011111001100001 |
3 | 1101200201020102111110110021 |
4 | 2122322201020303321201 |
5 | 2343404223343312433 |
6 | 34350311440033441 |
7 | 2146056460245262 |
oct | 232724110637141 |
9 | 41621212443407 |
10 | 10645632400993 |
11 | 3434872a60907 |
12 | 123b240902881 |
13 | 5c2b56a28525 |
14 | 28b373a20969 |
15 | 136db5ebc22d |
hex | 9aea1233e61 |
10645632400993 has 2 divisors, whose sum is σ = 10645632400994. Its totient is φ = 10645632400992.
The previous prime is 10645632400981. The next prime is 10645632401009. The reversal of 10645632400993 is 39900423654601.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7488798945489 + 3156833455504 = 2736567^2 + 1776748^2 .
It is a cyclic number.
It is not a de Polignac number, because 10645632400993 - 229 = 10645095530081 is a prime.
It is a super-2 number, since 2×106456324009932 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10645632400993.
It is not a weakly prime, because it can be changed into another prime (10645632400913) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5322816200496 + 5322816200497.
It is an arithmetic number, because the mean of its divisors is an integer number (5322816200497).
Almost surely, 210645632400993 is an apocalyptic number.
It is an amenable number.
10645632400993 is a deficient number, since it is larger than the sum of its proper divisors (1).
10645632400993 is an equidigital number, since it uses as much as digits as its factorization.
10645632400993 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4199040, while the sum is 52.
The spelling of 10645632400993 in words is "ten trillion, six hundred forty-five billion, six hundred thirty-two million, four hundred thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.162 sec. • engine limits •