Base | Representation |
---|---|
bin | 1001101000110101001111… |
… | …0110001010011111010101 |
3 | 1101112001221111100011102012 |
4 | 2122031103312022133111 |
5 | 2342110320300330101 |
6 | 34312123021554005 |
7 | 2142420536340221 |
oct | 232152366123725 |
9 | 41461844304365 |
10 | 10597091026901 |
11 | 341622368a015 |
12 | 1231954415905 |
13 | 5bb3bc222972 |
14 | 288c8ad03781 |
15 | 1359c46ecbbb |
hex | 9a353d8a7d5 |
10597091026901 has 2 divisors, whose sum is σ = 10597091026902. Its totient is φ = 10597091026900.
The previous prime is 10597091026787. The next prime is 10597091026993. The reversal of 10597091026901 is 10962019079501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6395107611025 + 4201983415876 = 2528855^2 + 2049874^2 .
It is a cyclic number.
It is not a de Polignac number, because 10597091026901 - 222 = 10597086832597 is a prime.
It is a super-2 number, since 2×105970910269012 (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 10597091026901.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10597091022901) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5298545513450 + 5298545513451.
It is an arithmetic number, because the mean of its divisors is an integer number (5298545513451).
Almost surely, 210597091026901 is an apocalyptic number.
It is an amenable number.
10597091026901 is a deficient number, since it is larger than the sum of its proper divisors (1).
10597091026901 is an equidigital number, since it uses as much as digits as its factorization.
10597091026901 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 306180, while the sum is 50.
The spelling of 10597091026901 in words is "ten trillion, five hundred ninety-seven billion, ninety-one million, twenty-six thousand, nine hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •