Base | Representation |
---|---|
bin | 1001101001001111000100… |
… | …0100110101011111010101 |
3 | 1101112201211122200201222221 |
4 | 2122103301010311133111 |
5 | 2342214020102111003 |
6 | 34315231000422341 |
7 | 2143054411435132 |
oct | 232236104653725 |
9 | 41481748621887 |
10 | 10604023863253 |
11 | 341916102a637 |
12 | 123316a1779b1 |
13 | 5bbc556410b2 |
14 | 289347979589 |
15 | 135c7d19b7bd |
hex | 9a4f11357d5 |
10604023863253 has 2 divisors, whose sum is σ = 10604023863254. Its totient is φ = 10604023863252.
The previous prime is 10604023863247. The next prime is 10604023863317. The reversal of 10604023863253 is 35236832040601.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7696446417009 + 2907577446244 = 2774247^2 + 1705162^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10604023863253 is a prime.
It is a super-2 number, since 2×106040238632532 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10604023863553) 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 as a sum of consecutive naturals, namely, 5302011931626 + 5302011931627.
It is an arithmetic number, because the mean of its divisors is an integer number (5302011931627).
Almost surely, 210604023863253 is an apocalyptic number.
It is an amenable number.
10604023863253 is a deficient number, since it is larger than the sum of its proper divisors (1).
10604023863253 is an equidigital number, since it uses as much as digits as its factorization.
10604023863253 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 622080, while the sum is 43.
The spelling of 10604023863253 in words is "ten trillion, six hundred four billion, twenty-three million, eight hundred sixty-three thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •