Base | Representation |
---|---|
bin | 1001101011101001010011… |
… | …0110011011101001010001 |
3 | 1101200200201001121020022202 |
4 | 2122322110312123221101 |
5 | 2343403313110201330 |
6 | 34350235153412545 |
7 | 2146051405116650 |
oct | 232722466335121 |
9 | 41620631536282 |
10 | 10645426256465 |
11 | 3434777661430 |
12 | 123b1a386a155 |
13 | 5c2b230cc510 |
14 | 28b3544bd197 |
15 | 136da2d4c445 |
hex | 9ae94d9ba51 |
10645426256465 has 64 divisors (see below), whose sum is σ = 17321612216832. Its totient is φ = 6064989696000.
The previous prime is 10645426256461. The next prime is 10645426256533. The reversal of 10645426256465 is 56465262454601.
It is not a de Polignac number, because 10645426256465 - 22 = 10645426256461 is a prime.
It is a super-2 number, since 2×106454262564652 (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 10645426256465.
It is not an unprimeable number, because it can be changed into a prime (10645426256461) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 10023992 + ... + 11035001.
It is an arithmetic number, because the mean of its divisors is an integer number (270650190888).
Almost surely, 210645426256465 is an apocalyptic number.
It is an amenable number.
10645426256465 is a deficient number, since it is larger than the sum of its proper divisors (6676185960367).
10645426256465 is a wasteful number, since it uses less digits than its factorization.
10645426256465 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21059130.
The product of its (nonzero) digits is 41472000, while the sum is 56.
The spelling of 10645426256465 in words is "ten trillion, six hundred forty-five billion, four hundred twenty-six million, two hundred fifty-six thousand, four hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •