Base | Representation |
---|---|
bin | 1001101011101000101011… |
… | …1110100000100011011001 |
3 | 1101200200021111220002111221 |
4 | 2122322022332200203121 |
5 | 2343402443203222221 |
6 | 34350210515052041 |
7 | 2146044324066025 |
oct | 232721276404331 |
9 | 41620244802457 |
10 | 10645260601561 |
11 | 34346a20a7453 |
12 | 123b1582a1021 |
13 | 5c2ac79abb71 |
14 | 28b33a4bb385 |
15 | 136d93529541 |
hex | 9ae8afa08d9 |
10645260601561 has 2 divisors, whose sum is σ = 10645260601562. Its totient is φ = 10645260601560.
The previous prime is 10645260601531. The next prime is 10645260601627. The reversal of 10645260601561 is 16510606254601.
10645260601561 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., 10075037774400 + 570222827161 = 3174120^2 + 755131^2 .
It is a cyclic number.
It is not a de Polignac number, because 10645260601561 - 229 = 10644723730649 is a prime.
It is a super-2 number, since 2×106452606015612 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10645260601531) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5322630300780 + 5322630300781.
It is an arithmetic number, because the mean of its divisors is an integer number (5322630300781).
Almost surely, 210645260601561 is an apocalyptic number.
It is an amenable number.
10645260601561 is a deficient number, since it is larger than the sum of its proper divisors (1).
10645260601561 is an equidigital number, since it uses as much as digits as its factorization.
10645260601561 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 259200, while the sum is 43.
The spelling of 10645260601561 in words is "ten trillion, six hundred forty-five billion, two hundred sixty million, six hundred one thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •