Base | Representation |
---|---|
bin | 1001101011101001010011… |
… | …0110101011110111110001 |
3 | 1101200200201001201121111101 |
4 | 2122322110312223313301 |
5 | 2343403313114313204 |
6 | 34350235155044401 |
7 | 2146051405514506 |
oct | 232722466536761 |
9 | 41620631647441 |
10 | 10645426322929 |
11 | 34347776a7362 |
12 | 123b1a38a0701 |
13 | 5c2b23123848 |
14 | 28b3544d94ad |
15 | 136da2d61ea4 |
hex | 9ae94dabdf1 |
10645426322929 has 2 divisors, whose sum is σ = 10645426322930. Its totient is φ = 10645426322928.
The previous prime is 10645426322911. The next prime is 10645426322939. The reversal of 10645426322929 is 92922362454601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10051131803904 + 594294519025 = 3170352^2 + 770905^2 .
It is a cyclic number.
It is not a de Polignac number, because 10645426322929 - 27 = 10645426322801 is a prime.
It is a super-2 number, since 2×106454263229292 (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 10645426322929.
It is not a weakly prime, because it can be changed into another prime (10645426322939) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5322713161464 + 5322713161465.
It is an arithmetic number, because the mean of its divisors is an integer number (5322713161465).
Almost surely, 210645426322929 is an apocalyptic number.
It is an amenable number.
10645426322929 is a deficient number, since it is larger than the sum of its proper divisors (1).
10645426322929 is an equidigital number, since it uses as much as digits as its factorization.
10645426322929 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 11197440, while the sum is 55.
The spelling of 10645426322929 in words is "ten trillion, six hundred forty-five billion, four hundred twenty-six million, three hundred twenty-two thousand, nine hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •