Base | Representation |
---|---|
bin | 1010100101111101010100… |
… | …1100001010000000101001 |
3 | 1112020110112200212110101212 |
4 | 2221133111030022000221 |
5 | 3011312013131320233 |
6 | 40434355350322505 |
7 | 2311325202424154 |
oct | 251372514120051 |
9 | 45213480773355 |
10 | 11647233073193 |
11 | 3790622477493 |
12 | 138138a959435 |
13 | 666438803a83 |
14 | 2c3a2c894c9b |
15 | 152e88016a48 |
hex | a97d530a029 |
11647233073193 has 2 divisors, whose sum is σ = 11647233073194. Its totient is φ = 11647233073192.
The previous prime is 11647233073129. The next prime is 11647233073219. The reversal of 11647233073193 is 39137033274611.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11629648191529 + 17584881664 = 3410227^2 + 132608^2 .
It is a cyclic number.
It is not a de Polignac number, because 11647233073193 - 26 = 11647233073129 is a prime.
It is a super-2 number, since 2×116472330731932 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11647233073123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5823616536596 + 5823616536597.
It is an arithmetic number, because the mean of its divisors is an integer number (5823616536597).
Almost surely, 211647233073193 is an apocalyptic number.
It is an amenable number.
11647233073193 is a deficient number, since it is larger than the sum of its proper divisors (1).
11647233073193 is an equidigital number, since it uses as much as digits as its factorization.
11647233073193 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1714608, while the sum is 50.
The spelling of 11647233073193 in words is "eleven trillion, six hundred forty-seven billion, two hundred thirty-three million, seventy-three thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •