Base | Representation |
---|---|
bin | 10100101110110100… |
… | …00010111101110101 |
3 | 1001201200021210012111 |
4 | 22113122002331311 |
5 | 140243302401401 |
6 | 5040233051021 |
7 | 542546322400 |
oct | 122732027565 |
9 | 31650253174 |
10 | 11130122101 |
11 | 47a173351a |
12 | 21a7556a71 |
13 | 1084b86887 |
14 | 7782a2d37 |
15 | 4521e3e51 |
hex | 297682f75 |
11130122101 has 6 divisors (see below), whose sum is σ = 12947284950. Its totient is φ = 9540104616.
The previous prime is 11130122089. The next prime is 11130122111. The reversal of 11130122101 is 10122103111.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 10523682225 + 606439876 = 102585^2 + 24626^2 .
It is not a de Polignac number, because 11130122101 - 27 = 11130121973 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11130122111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 113572626 + ... + 113572723.
It is an arithmetic number, because the mean of its divisors is an integer number (2157880825).
Almost surely, 211130122101 is an apocalyptic number.
It is an amenable number.
11130122101 is a deficient number, since it is larger than the sum of its proper divisors (1817162849).
11130122101 is an equidigital number, since it uses as much as digits as its factorization.
11130122101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 227145363 (or 227145356 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 11130122101 its reverse (10122103111), we get a palindrome (21252225212).
The spelling of 11130122101 in words is "eleven billion, one hundred thirty million, one hundred twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •