Base | Representation |
---|---|
bin | 10100100101111011… |
… | …11101010011101011 |
3 | 1001112111011012201112 |
4 | 22102331331103223 |
5 | 140120221300102 |
6 | 5025012540535 |
7 | 540653321552 |
oct | 122275752353 |
9 | 31474135645 |
10 | 11055650027 |
11 | 4763698554 |
12 | 218662174b |
13 | 1072610666 |
14 | 76c438d99 |
15 | 44a8d3252 |
hex | 292f7d4eb |
11055650027 has 2 divisors, whose sum is σ = 11055650028. Its totient is φ = 11055650026.
The previous prime is 11055650017. The next prime is 11055650033. The reversal of 11055650027 is 72005655011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11055650027 - 214 = 11055633643 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11055649975 and 11055650002.
It is not a weakly prime, because it can be changed into another prime (11055650017) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5527825013 + 5527825014.
It is an arithmetic number, because the mean of its divisors is an integer number (5527825014).
Almost surely, 211055650027 is an apocalyptic number.
11055650027 is a deficient number, since it is larger than the sum of its proper divisors (1).
11055650027 is an equidigital number, since it uses as much as digits as its factorization.
11055650027 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10500, while the sum is 32.
The spelling of 11055650027 in words is "eleven billion, fifty-five million, six hundred fifty thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •