Base | Representation |
---|---|
bin | 10100101011000110… |
… | …11000000001011011 |
3 | 1001122111202021211101 |
4 | 22111203120001123 |
5 | 140212321410321 |
6 | 5033202212231 |
7 | 542021025046 |
oct | 122543300133 |
9 | 31574667741 |
10 | 11099013211 |
11 | 47861159a0 |
12 | 2199054077 |
13 | 107b5b3c50 |
14 | 7740c5c5d |
15 | 44e5eb791 |
hex | 2958d805b |
11099013211 has 8 divisors (see below), whose sum is σ = 13039400304. Its totient is φ = 9313857120.
The previous prime is 11099013209. The next prime is 11099013251. The reversal of 11099013211 is 11231099011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11099013211 - 21 = 11099013209 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11099013211.
It is not an unprimeable number, because it can be changed into a prime (11099013251) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 38807596 + ... + 38807881.
It is an arithmetic number, because the mean of its divisors is an integer number (1629925038).
Almost surely, 211099013211 is an apocalyptic number.
11099013211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11099013211 is a deficient number, since it is larger than the sum of its proper divisors (1940387093).
11099013211 is a wasteful number, since it uses less digits than its factorization.
11099013211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 77615501.
The product of its (nonzero) digits is 486, while the sum is 28.
The spelling of 11099013211 in words is "eleven billion, ninety-nine million, thirteen thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •