Base | Representation |
---|---|
bin | 1001101011011110111100… |
… | …0110100011001001101001 |
3 | 1101200102112021001022201112 |
4 | 2122313233012203021221 |
5 | 2343332114214314112 |
6 | 34345055215400105 |
7 | 2145622450556204 |
oct | 232675706431151 |
9 | 41612467038645 |
10 | 10642645463657 |
11 | 343357aa02659 |
12 | 123a748523035 |
13 | 5c279bc6889c |
14 | 28b16d05893b |
15 | 136c8db58a22 |
hex | 9adef1a3269 |
10642645463657 has 2 divisors, whose sum is σ = 10642645463658. Its totient is φ = 10642645463656.
The previous prime is 10642645463551. The next prime is 10642645463713. The reversal of 10642645463657 is 75636454624601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5538769264681 + 5103876198976 = 2353459^2 + 2259176^2 .
It is a cyclic number.
It is not a de Polignac number, because 10642645463657 - 240 = 9543133835881 is a prime.
It is a super-2 number, since 2×106426454636572 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10642645463596 and 10642645463605.
It is not a weakly prime, because it can be changed into another prime (10642645466657) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5321322731828 + 5321322731829.
It is an arithmetic number, because the mean of its divisors is an integer number (5321322731829).
Almost surely, 210642645463657 is an apocalyptic number.
It is an amenable number.
10642645463657 is a deficient number, since it is larger than the sum of its proper divisors (1).
10642645463657 is an equidigital number, since it uses as much as digits as its factorization.
10642645463657 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 87091200, while the sum is 59.
The spelling of 10642645463657 in words is "ten trillion, six hundred forty-two billion, six hundred forty-five million, four hundred sixty-three thousand, six hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •