Base | Representation |
---|---|
bin | 1010000000100111000110… |
… | …0000101100110101111111 |
3 | 1102222010101221000012101112 |
4 | 2200021301200230311333 |
5 | 2420303442304010142 |
6 | 35223524022232235 |
7 | 2214062201450114 |
oct | 240116140546577 |
9 | 42863357005345 |
10 | 11005610610047 |
11 | 35634a9301319 |
12 | 1298b6488567b |
13 | 61aa94924961 |
14 | 2a096278290b |
15 | 141434027382 |
hex | a027182cd7f |
11005610610047 has 2 divisors, whose sum is σ = 11005610610048. Its totient is φ = 11005610610046.
The previous prime is 11005610609969. The next prime is 11005610610061. The reversal of 11005610610047 is 74001601650011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11005610610047 - 218 = 11005610347903 is a prime.
It is a super-2 number, since 2×110056106100472 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11005610609995 and 11005610610022.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11005610610347) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5502805305023 + 5502805305024.
It is an arithmetic number, because the mean of its divisors is an integer number (5502805305024).
Almost surely, 211005610610047 is an apocalyptic number.
11005610610047 is a deficient number, since it is larger than the sum of its proper divisors (1).
11005610610047 is an equidigital number, since it uses as much as digits as its factorization.
11005610610047 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5040, while the sum is 32.
The spelling of 11005610610047 in words is "eleven trillion, five billion, six hundred ten million, six hundred ten thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •