Base | Representation |
---|---|
bin | 1001101011101001010011… |
… | …0110011011101001001101 |
3 | 1101200200201001121020022121 |
4 | 2122322110312123221031 |
5 | 2343403313110201321 |
6 | 34350235153412541 |
7 | 2146051405116643 |
oct | 232722466335115 |
9 | 41620631536277 |
10 | 10645426256461 |
11 | 3434777661427 |
12 | 123b1a386a151 |
13 | 5c2b230cc509 |
14 | 28b3544bd193 |
15 | 136da2d4c441 |
hex | 9ae94d9ba4d |
10645426256461 has 2 divisors, whose sum is σ = 10645426256462. Its totient is φ = 10645426256460.
The previous prime is 10645426256453. The next prime is 10645426256533. The reversal of 10645426256461 is 16465262454601.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10202236480836 + 443189775625 = 3194094^2 + 665725^2 .
It is a cyclic number.
It is not a de Polignac number, because 10645426256461 - 23 = 10645426256453 is a prime.
It is a super-2 number, since 2×106454262564612 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10645426256399 and 10645426256408.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10645426256161) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5322713128230 + 5322713128231.
It is an arithmetic number, because the mean of its divisors is an integer number (5322713128231).
Almost surely, 210645426256461 is an apocalyptic number.
It is an amenable number.
10645426256461 is a deficient number, since it is larger than the sum of its proper divisors (1).
10645426256461 is an equidigital number, since it uses as much as digits as its factorization.
10645426256461 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8294400, while the sum is 52.
The spelling of 10645426256461 in words is "ten trillion, six hundred forty-five billion, four hundred twenty-six million, two hundred fifty-six thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •