Base | Representation |
---|---|
bin | 10100100001001011… |
… | …00011111010000101 |
3 | 1001102200222112201122 |
4 | 22100211203322011 |
5 | 140030004400401 |
6 | 5021024403325 |
7 | 536656622510 |
oct | 122045437205 |
9 | 31380875648 |
10 | 11015700101 |
11 | 474309158a |
12 | 2175176545 |
13 | 1067263853 |
14 | 766dd9d77 |
15 | 44714121b |
hex | 290963e85 |
11015700101 has 8 divisors (see below), whose sum is σ = 12590932224. Its totient is φ = 9440858160.
The previous prime is 11015700089. The next prime is 11015700119. The reversal of 11015700101 is 10100751011.
It is a happy number.
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 11015700101 - 210 = 11015699077 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 11015700101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11015700161) 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, 34310 + ... + 152343.
It is an arithmetic number, because the mean of its divisors is an integer number (1573866528).
Almost surely, 211015700101 is an apocalyptic number.
It is an amenable number.
11015700101 is a deficient number, since it is larger than the sum of its proper divisors (1575232123).
11015700101 is an equidigital number, since it uses as much as digits as its factorization.
11015700101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 195091.
The product of its (nonzero) digits is 35, while the sum is 17.
The spelling of 11015700101 in words is "eleven billion, fifteen million, seven hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •