Base | Representation |
---|---|
bin | 10100100000101000… |
… | …00000110100101111 |
3 | 1001102101022211111201 |
4 | 22100110000310233 |
5 | 140022320144301 |
6 | 5020342030331 |
7 | 536602543135 |
oct | 122024006457 |
9 | 31371284451 |
10 | 11011099951 |
11 | 474052a405 |
12 | 21737183a7 |
13 | 1066312a77 |
14 | 76655d755 |
15 | 446a33201 |
hex | 290500d2f |
11011099951 has 2 divisors, whose sum is σ = 11011099952. Its totient is φ = 11011099950.
The previous prime is 11011099921. The next prime is 11011099961. The reversal of 11011099951 is 15999011011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11011099951 - 29 = 11011099439 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11011099951.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11011099921) 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, 5505549975 + 5505549976.
It is an arithmetic number, because the mean of its divisors is an integer number (5505549976).
Almost surely, 211011099951 is an apocalyptic number.
11011099951 is a deficient number, since it is larger than the sum of its proper divisors (1).
11011099951 is an equidigital number, since it uses as much as digits as its factorization.
11011099951 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3645, while the sum is 37.
The spelling of 11011099951 in words is "eleven billion, eleven million, ninety-nine thousand, nine hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •