Base | Representation |
---|---|
bin | 10100100101111011… |
… | …11101100011011101 |
3 | 1001112111011021002221 |
4 | 22102331331203131 |
5 | 140120221313122 |
6 | 5025012545341 |
7 | 540653324524 |
oct | 122275754335 |
9 | 31474137087 |
10 | 11055651037 |
11 | 4763699292 |
12 | 2186622251 |
13 | 1072610c62 |
14 | 76c4394bb |
15 | 44a8d36c7 |
hex | 292f7d8dd |
11055651037 has 2 divisors, whose sum is σ = 11055651038. Its totient is φ = 11055651036.
The previous prime is 11055651007. The next prime is 11055651053. The reversal of 11055651037 is 73015655011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11030460676 + 25190361 = 105026^2 + 5019^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11055651037 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11055650993 and 11055651011.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11055651007) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5527825518 + 5527825519.
It is an arithmetic number, because the mean of its divisors is an integer number (5527825519).
Almost surely, 211055651037 is an apocalyptic number.
It is an amenable number.
11055651037 is a deficient number, since it is larger than the sum of its proper divisors (1).
11055651037 is an equidigital number, since it uses as much as digits as its factorization.
11055651037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15750, while the sum is 34.
The spelling of 11055651037 in words is "eleven billion, fifty-five million, six hundred fifty-one thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •