Base | Representation |
---|---|
bin | 1001111010101110110000… |
… | …1011111110111011010001 |
3 | 1102121110122121002012220221 |
4 | 2132223230023332323101 |
5 | 2412130044411432203 |
6 | 35105255502433041 |
7 | 2203554615633622 |
oct | 236535413767321 |
9 | 42543577065827 |
10 | 10904589561553 |
11 | 3524679586396 |
12 | 1281470b92781 |
13 | 6113b571860c |
14 | 299adbc95a49 |
15 | 13d9c034eabd |
hex | 9eaec2feed1 |
10904589561553 has 2 divisors, whose sum is σ = 10904589561554. Its totient is φ = 10904589561552.
The previous prime is 10904589561529. The next prime is 10904589561601. The reversal of 10904589561553 is 35516598540901.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10832181747984 + 72407813569 = 3291228^2 + 269087^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10904589561553 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10904589561491 and 10904589561500.
It is not a weakly prime, because it can be changed into another prime (10904589561953) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5452294780776 + 5452294780777.
It is an arithmetic number, because the mean of its divisors is an integer number (5452294780777).
Almost surely, 210904589561553 is an apocalyptic number.
It is an amenable number.
10904589561553 is a deficient number, since it is larger than the sum of its proper divisors (1).
10904589561553 is an equidigital number, since it uses as much as digits as its factorization.
10904589561553 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 29160000, while the sum is 61.
The spelling of 10904589561553 in words is "ten trillion, nine hundred four billion, five hundred eighty-nine million, five hundred sixty-one thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •