Base | Representation |
---|---|
bin | 10101101001100010… |
… | …00011000100001001 |
3 | 1010000000010212211001 |
4 | 22310301003010021 |
5 | 142300402103311 |
6 | 5201150335001 |
7 | 561010146511 |
oct | 126461030411 |
9 | 33000125731 |
10 | 11622691081 |
11 | 4a24784921 |
12 | 23044ba461 |
13 | 1132c39501 |
14 | 7c3882841 |
15 | 4805904c1 |
hex | 2b4c43109 |
11622691081 has 2 divisors, whose sum is σ = 11622691082. Its totient is φ = 11622691080.
The previous prime is 11622691051. The next prime is 11622691139. The reversal of 11622691081 is 18019622611.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6466733056 + 5155958025 = 80416^2 + 71805^2 .
It is an emirp because it is prime and its reverse (18019622611) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11622691081 - 217 = 11622560009 is a prime.
It is a super-2 number, since 2×116226910812 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 11622691081.
It is not a weakly prime, because it can be changed into another prime (11622691051) 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, 5811345540 + 5811345541.
It is an arithmetic number, because the mean of its divisors is an integer number (5811345541).
Almost surely, 211622691081 is an apocalyptic number.
It is an amenable number.
11622691081 is a deficient number, since it is larger than the sum of its proper divisors (1).
11622691081 is an equidigital number, since it uses as much as digits as its factorization.
11622691081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10368, while the sum is 37.
The spelling of 11622691081 in words is "eleven billion, six hundred twenty-two million, six hundred ninety-one thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •