Base | Representation |
---|---|
bin | 1001101011101001010011… |
… | …0110101101110111110001 |
3 | 1101200200201001202000201210 |
4 | 2122322110312231313301 |
5 | 2343403313120043441 |
6 | 34350235155150333 |
7 | 2146051405550421 |
oct | 232722466556761 |
9 | 41620631660653 |
10 | 10645426331121 |
11 | 343477770252a |
12 | 123b1a38a53a9 |
13 | 5c2b231274aa |
14 | 28b3544dc481 |
15 | 136da2d64616 |
hex | 9ae94daddf1 |
10645426331121 has 64 divisors (see below), whose sum is σ = 14859465523200. Its totient is φ = 6771469985280.
The previous prime is 10645426331069. The next prime is 10645426331161. The reversal of 10645426331121 is 12113362454601.
It is not a de Polignac number, because 10645426331121 - 213 = 10645426322929 is a prime.
It is a super-2 number, since 2×106454263311212 (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 10645426331121.
It is not an unprimeable number, because it can be changed into a prime (10645426331161) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1539020155 + ... + 1539027071.
It is an arithmetic number, because the mean of its divisors is an integer number (232179148800).
Almost surely, 210645426331121 is an apocalyptic number.
It is an amenable number.
10645426331121 is a deficient number, since it is larger than the sum of its proper divisors (4214039192079).
10645426331121 is a wasteful number, since it uses less digits than its factorization.
10645426331121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7894.
The product of its (nonzero) digits is 103680, while the sum is 39.
Adding to 10645426331121 its reverse (12113362454601), we get a palindrome (22758788785722).
The spelling of 10645426331121 in words is "ten trillion, six hundred forty-five billion, four hundred twenty-six million, three hundred thirty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •