Base | Representation |
---|---|
bin | 10100100000101001… |
… | …00000110100001111 |
3 | 1001102101120111021001 |
4 | 22100110200310033 |
5 | 140022333342431 |
6 | 5020344521131 |
7 | 536603630155 |
oct | 122024406417 |
9 | 31371514231 |
10 | 11011230991 |
11 | 4740609902 |
12 | 21737801a7 |
13 | 106635a5c7 |
14 | 7665953d5 |
15 | 446a5be61 |
hex | 290520d0f |
11011230991 has 2 divisors, whose sum is σ = 11011230992. Its totient is φ = 11011230990.
The previous prime is 11011230941. The next prime is 11011231037. The reversal of 11011230991 is 19903211011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11011230991 - 27 = 11011230863 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11011230931) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5505615495 + 5505615496.
It is an arithmetic number, because the mean of its divisors is an integer number (5505615496).
Almost surely, 211011230991 is an apocalyptic number.
11011230991 is a deficient number, since it is larger than the sum of its proper divisors (1).
11011230991 is an equidigital number, since it uses as much as digits as its factorization.
11011230991 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 486, while the sum is 28.
The spelling of 11011230991 in words is "eleven billion, eleven million, two hundred thirty thousand, nine hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •