Base | Representation |
---|---|
bin | 10100100100011000… |
… | …11000000100101101 |
3 | 1001111120200212102012 |
4 | 22102030120010231 |
5 | 140103404334321 |
6 | 5023430211005 |
7 | 540434666021 |
oct | 122214300455 |
9 | 31446625365 |
10 | 11042652461 |
11 | 4757320265 |
12 | 21821b3a65 |
13 | 106ca0c5a9 |
14 | 76a814381 |
15 | 4496b705b |
hex | 29231812d |
11042652461 has 2 divisors, whose sum is σ = 11042652462. Its totient is φ = 11042652460.
The previous prime is 11042652457. The next prime is 11042652463. The reversal of 11042652461 is 16425624011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8513568361 + 2529084100 = 92269^2 + 50290^2 .
It is a cyclic number.
It is not a de Polignac number, because 11042652461 - 22 = 11042652457 is a prime.
Together with 11042652463, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11042652463) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5521326230 + 5521326231.
It is an arithmetic number, because the mean of its divisors is an integer number (5521326231).
Almost surely, 211042652461 is an apocalyptic number.
It is an amenable number.
11042652461 is a deficient number, since it is larger than the sum of its proper divisors (1).
11042652461 is an equidigital number, since it uses as much as digits as its factorization.
11042652461 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11520, while the sum is 32.
The spelling of 11042652461 in words is "eleven billion, forty-two million, six hundred fifty-two thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •