Base | Representation |
---|---|
bin | 10100100001001011… |
… | …00011111010100011 |
3 | 1001102200222112202202 |
4 | 22100211203322203 |
5 | 140030004401011 |
6 | 5021024403415 |
7 | 536656622552 |
oct | 122045437243 |
9 | 31380875682 |
10 | 11015700131 |
11 | 4743091607 |
12 | 217517656b |
13 | 1067263877 |
14 | 766dd9d99 |
15 | 44714123b |
hex | 290963ea3 |
11015700131 has 4 divisors (see below), whose sum is σ = 11018019600. Its totient is φ = 11013380664.
The previous prime is 11015700119. The next prime is 11015700161. The reversal of 11015700131 is 13100751011.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 13100751011 = 19309 ⋅678479.
It is a cyclic number.
It is not a de Polignac number, because 11015700131 - 226 = 10948591267 is a prime.
It is a super-2 number, since 2×110157001312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian 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 3 ways as a sum of consecutive naturals, for example, 1152596 + ... + 1162113.
It is an arithmetic number, because the mean of its divisors is an integer number (2754504900).
Almost surely, 211015700131 is an apocalyptic number.
11015700131 is a deficient number, since it is larger than the sum of its proper divisors (2319469).
11015700131 is an equidigital number, since it uses as much as digits as its factorization.
11015700131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2319468.
The product of its (nonzero) digits is 105, while the sum is 20.
The spelling of 11015700131 in words is "eleven billion, fifteen million, seven hundred thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •