Base | Representation |
---|---|
bin | 10100010101010010… |
… | …11010001010010101 |
3 | 1001011202110120021001 |
4 | 22022221122022111 |
5 | 134324001423321 |
6 | 5003104423301 |
7 | 534336566266 |
oct | 121251321225 |
9 | 31152416231 |
10 | 10916045461 |
11 | 46a1906582 |
12 | 2147917b31 |
13 | 104c7112c9 |
14 | 757a9896d |
15 | 43d508c91 |
hex | 28aa5a295 |
10916045461 has 2 divisors, whose sum is σ = 10916045462. Its totient is φ = 10916045460.
The previous prime is 10916045443. The next prime is 10916045507. The reversal of 10916045461 is 16454061901.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9144140625 + 1771904836 = 95625^2 + 42094^2 .
It is a cyclic number.
It is not a de Polignac number, because 10916045461 - 215 = 10916012693 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10916045461.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10916045401) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5458022730 + 5458022731.
It is an arithmetic number, because the mean of its divisors is an integer number (5458022731).
Almost surely, 210916045461 is an apocalyptic number.
It is an amenable number.
10916045461 is a deficient number, since it is larger than the sum of its proper divisors (1).
10916045461 is an equidigital number, since it uses as much as digits as its factorization.
10916045461 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 25920, while the sum is 37.
The spelling of 10916045461 in words is "ten billion, nine hundred sixteen million, forty-five thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.120 sec. • engine limits •