Base | Representation |
---|---|
bin | 1010000000110111011100… |
… | …1101001000001111011001 |
3 | 1102222112201220111201001001 |
4 | 2200031313031020033121 |
5 | 2420341440241004402 |
6 | 35225531422025001 |
7 | 2214306043210342 |
oct | 240156715101731 |
9 | 42875656451031 |
10 | 11010001109977 |
11 | 3565351661961 |
12 | 129998b118161 |
13 | 61b31440c7cc |
14 | 2a0c5b9070c9 |
15 | 1415de6d6187 |
hex | a03773483d9 |
11010001109977 has 2 divisors, whose sum is σ = 11010001109978. Its totient is φ = 11010001109976.
The previous prime is 11010001109909. The next prime is 11010001110011. The reversal of 11010001109977 is 77990110001011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11006874510921 + 3126599056 = 3317661^2 + 55916^2 .
It is a cyclic number.
It is not a de Polignac number, because 11010001109977 - 215 = 11010001077209 is a prime.
It is not a weakly prime, because it can be changed into another prime (11010001109477) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5505000554988 + 5505000554989.
It is an arithmetic number, because the mean of its divisors is an integer number (5505000554989).
Almost surely, 211010001109977 is an apocalyptic number.
It is an amenable number.
11010001109977 is a deficient number, since it is larger than the sum of its proper divisors (1).
11010001109977 is an equidigital number, since it uses as much as digits as its factorization.
11010001109977 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3969, while the sum is 37.
The spelling of 11010001109977 in words is "eleven trillion, ten billion, one million, one hundred nine thousand, nine hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •