Base | Representation |
---|---|
bin | 10100101110110110… |
… | …11111010110010101 |
3 | 1001201201000000021022 |
4 | 22113123133112111 |
5 | 140243402004001 |
6 | 5040245130525 |
7 | 542552456531 |
oct | 122733372625 |
9 | 31651000238 |
10 | 11130500501 |
11 | 47a197184a |
12 | 21a76b9a45 |
13 | 1084c89b93 |
14 | 778360bc1 |
15 | 45226b11b |
hex | 2976df595 |
11130500501 has 4 divisors (see below), whose sum is σ = 11130866604. Its totient is φ = 11130134400.
The previous prime is 11130500441. The next prime is 11130500503. The reversal of 11130500501 is 10500503111.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 3960814225 + 7169686276 = 62935^2 + 84674^2 .
It is a cyclic number.
It is not a de Polignac number, because 11130500501 - 226 = 11063391637 is a prime.
It is a super-2 number, since 2×111305005012 (a number of 21 digits) contains 22 as substring.
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 11130500501.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11130500503) 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, 132860 + ... + 199781.
It is an arithmetic number, because the mean of its divisors is an integer number (2782716651).
Almost surely, 211130500501 is an apocalyptic number.
It is an amenable number.
11130500501 is a deficient number, since it is larger than the sum of its proper divisors (366103).
11130500501 is an equidigital number, since it uses as much as digits as its factorization.
11130500501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 366102.
The product of its (nonzero) digits is 75, while the sum is 17.
The spelling of 11130500501 in words is "eleven billion, one hundred thirty million, five hundred thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •