Base | Representation |
---|---|
bin | 1010100011100001111100… |
… | …0001110011100001010101 |
3 | 1112002110212210111121000001 |
4 | 2220320133001303201111 |
5 | 3010121102140410121 |
6 | 40403300413451301 |
7 | 2305320442025614 |
oct | 250703701634125 |
9 | 45073783447001 |
10 | 11605522200661 |
11 | 37749687aa604 |
12 | 1375289aa0b31 |
13 | 66251c1691cc |
14 | 2c19d2db187b |
15 | 151d4622e991 |
hex | a8e1f073855 |
11605522200661 has 2 divisors, whose sum is σ = 11605522200662. Its totient is φ = 11605522200660.
The previous prime is 11605522200659. The next prime is 11605522200709. The reversal of 11605522200661 is 16600222550611.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11466993827025 + 138528373636 = 3386295^2 + 372194^2 .
It is a cyclic number.
It is not a de Polignac number, because 11605522200661 - 21 = 11605522200659 is a prime.
Together with 11605522200659, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 11605522200661.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11605522300661) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5802761100330 + 5802761100331.
It is an arithmetic number, because the mean of its divisors is an integer number (5802761100331).
Almost surely, 211605522200661 is an apocalyptic number.
It is an amenable number.
11605522200661 is a deficient number, since it is larger than the sum of its proper divisors (1).
11605522200661 is an equidigital number, since it uses as much as digits as its factorization.
11605522200661 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 43200, while the sum is 37.
The spelling of 11605522200661 in words is "eleven trillion, six hundred five billion, five hundred twenty-two million, two hundred thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •