Base | Representation |
---|---|
bin | 10100100001001011… |
… | …00011111010000011 |
3 | 1001102200222112201120 |
4 | 22100211203322003 |
5 | 140030004400344 |
6 | 5021024403323 |
7 | 536656622505 |
oct | 122045437203 |
9 | 31380875646 |
10 | 11015700099 |
11 | 4743091588 |
12 | 2175176543 |
13 | 1067263851 |
14 | 766dd9d75 |
15 | 447141219 |
hex | 290963e83 |
11015700099 has 8 divisors (see below), whose sum is σ = 14793266880. Its totient is φ = 7290966696.
The previous prime is 11015700089. The next prime is 11015700119. The reversal of 11015700099 is 99000751011.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11015700099 - 29 = 11015699587 is a prime.
It is a super-2 number, since 2×110157000992 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11015700019) 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, 13207857 + ... + 13208690.
It is an arithmetic number, because the mean of its divisors is an integer number (1849158360).
Almost surely, 211015700099 is an apocalyptic number.
11015700099 is a deficient number, since it is larger than the sum of its proper divisors (3777566781).
11015700099 is a wasteful number, since it uses less digits than its factorization.
11015700099 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26416689.
The product of its (nonzero) digits is 2835, while the sum is 33.
The spelling of 11015700099 in words is "eleven billion, fifteen million, seven hundred thousand, ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •