Base | Representation |
---|---|
bin | 10100100001000001… |
… | …10101110001100001 |
3 | 1001102121122200010211 |
4 | 22100200311301201 |
5 | 140024200300221 |
6 | 5020542054121 |
7 | 536643246514 |
oct | 122040656141 |
9 | 31377580124 |
10 | 11014462561 |
11 | 4742416823 |
12 | 217487a341 |
13 | 1066c1c48b |
14 | 766b96d7b |
15 | 446e996e1 |
hex | 290835c61 |
11014462561 has 2 divisors, whose sum is σ = 11014462562. Its totient is φ = 11014462560.
The previous prime is 11014462559. The next prime is 11014462601. The reversal of 11014462561 is 16526441011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9158490000 + 1855972561 = 95700^2 + 43081^2 .
It is a cyclic number.
It is not a de Polignac number, because 11014462561 - 21 = 11014462559 is a prime.
Together with 11014462559, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (11014462531) 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, 5507231280 + 5507231281.
It is an arithmetic number, because the mean of its divisors is an integer number (5507231281).
Almost surely, 211014462561 is an apocalyptic number.
It is an amenable number.
11014462561 is a deficient number, since it is larger than the sum of its proper divisors (1).
11014462561 is an equidigital number, since it uses as much as digits as its factorization.
11014462561 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5760, while the sum is 31.
The spelling of 11014462561 in words is "eleven billion, fourteen million, four hundred sixty-two thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •