Base | Representation |
---|---|
bin | 1010010100000011001001… |
… | …1001001011101111110001 |
3 | 1111011001101101001102022112 |
4 | 2211000302121023233301 |
5 | 2441241404113431303 |
6 | 40041153242015105 |
7 | 2250153563130614 |
oct | 245006231135761 |
9 | 44131341042275 |
10 | 11339559123953 |
11 | 368209755a585 |
12 | 13318234a7495 |
13 | 643414b813c8 |
14 | 2b2ba24c017b |
15 | 149e7bcb50d8 |
hex | a503264bbf1 |
11339559123953 has 2 divisors, whose sum is σ = 11339559123954. Its totient is φ = 11339559123952.
The previous prime is 11339559123947. The next prime is 11339559123961. The reversal of 11339559123953 is 35932195593311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11131411486129 + 208147637824 = 3336377^2 + 456232^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11339559123953 is a prime.
It is a super-2 number, since 2×113395591239532 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11339559123892 and 11339559123901.
It is not a weakly prime, because it can be changed into another prime (11339559123253) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5669779561976 + 5669779561977.
It is an arithmetic number, because the mean of its divisors is an integer number (5669779561977).
Almost surely, 211339559123953 is an apocalyptic number.
It is an amenable number.
11339559123953 is a deficient number, since it is larger than the sum of its proper divisors (1).
11339559123953 is an equidigital number, since it uses as much as digits as its factorization.
11339559123953 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 14762250, while the sum is 59.
The spelling of 11339559123953 in words is "eleven trillion, three hundred thirty-nine billion, five hundred fifty-nine million, one hundred twenty-three thousand, nine hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •