Base | Representation |
---|---|
bin | 1010100011111101111111… |
… | …1001001101100011000001 |
3 | 1112010012022121212200001022 |
4 | 2220333133321031203001 |
5 | 3010232013021333303 |
6 | 40410543551115225 |
7 | 2306005164045614 |
oct | 250773771154301 |
9 | 45105277780038 |
10 | 11613052917953 |
11 | 3778082690a03 |
12 | 137682bb12b15 |
13 | 66314c3c0846 |
14 | 2c21091dc17b |
15 | 15213742d438 |
hex | a8fdfe4d8c1 |
11613052917953 has 2 divisors, whose sum is σ = 11613052917954. Its totient is φ = 11613052917952.
The previous prime is 11613052917919. The next prime is 11613052918031. The reversal of 11613052917953 is 35971925031611.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6655202933824 + 4957849984129 = 2579768^2 + 2226623^2 .
It is an emirp because it is prime and its reverse (35971925031611) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11613052917953 - 212 = 11613052913857 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11613052917895 and 11613052917904.
It is not a weakly prime, because it can be changed into another prime (11613052937953) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5806526458976 + 5806526458977.
It is an arithmetic number, because the mean of its divisors is an integer number (5806526458977).
Almost surely, 211613052917953 is an apocalyptic number.
It is an amenable number.
11613052917953 is a deficient number, since it is larger than the sum of its proper divisors (1).
11613052917953 is an equidigital number, since it uses as much as digits as its factorization.
11613052917953 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1530900, while the sum is 53.
The spelling of 11613052917953 in words is "eleven trillion, six hundred thirteen billion, fifty-two million, nine hundred seventeen thousand, nine hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •