Base | Representation |
---|---|
bin | 10100100110011101… |
… | …10001000000100001 |
3 | 1001112210110001201022 |
4 | 22103032301000201 |
5 | 140122333243342 |
6 | 5025251215225 |
7 | 541035632336 |
oct | 122316610041 |
9 | 31483401638 |
10 | 11060056097 |
11 | 4766127932 |
12 | 2187ba7515 |
13 | 10734c3cbc |
14 | 76cc6498d |
15 | 44aea39d2 |
hex | 2933b1021 |
11060056097 has 2 divisors, whose sum is σ = 11060056098. Its totient is φ = 11060056096.
The previous prime is 11060056087. The next prime is 11060056153. The reversal of 11060056097 is 79065006011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7402709521 + 3657346576 = 86039^2 + 60476^2 .
It is a cyclic number.
It is not a de Polignac number, because 11060056097 - 28 = 11060055841 is a prime.
It is not a weakly prime, because it can be changed into another prime (11060056087) 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, 5530028048 + 5530028049.
It is an arithmetic number, because the mean of its divisors is an integer number (5530028049).
Almost surely, 211060056097 is an apocalyptic number.
It is an amenable number.
11060056097 is a deficient number, since it is larger than the sum of its proper divisors (1).
11060056097 is an equidigital number, since it uses as much as digits as its factorization.
11060056097 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11340, while the sum is 35.
The spelling of 11060056097 in words is "eleven billion, sixty million, fifty-six thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •