Base | Representation |
---|---|
bin | 10100101110110100… |
… | …11000011100111110 |
3 | 1001201200110020221002 |
4 | 22113122120130332 |
5 | 140243313210420 |
6 | 5040235010302 |
7 | 542550140105 |
oct | 122732303476 |
9 | 31650406832 |
10 | 11130210110 |
11 | 47a1793658 |
12 | 21a7599992 |
13 | 1084bb7956 |
14 | 7782c703c |
15 | 452210075 |
hex | 29769873e |
11130210110 has 8 divisors (see below), whose sum is σ = 20034378216. Its totient is φ = 4452084040.
The previous prime is 11130210101. The next prime is 11130210137. The reversal of 11130210110 is 1101203111.
It is a happy number.
11130210110 is digitally balanced in base 5, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 11130210091 and 11130210100.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 556510496 + ... + 556510515.
It is an arithmetic number, because the mean of its divisors is an integer number (2504297277).
Almost surely, 211130210110 is an apocalyptic number.
11130210110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11130210110 is a deficient number, since it is larger than the sum of its proper divisors (8904168106).
11130210110 is a wasteful number, since it uses less digits than its factorization.
11130210110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1113021018.
The product of its (nonzero) digits is 6, while the sum is 11.
Adding to 11130210110 its reverse (1101203111), we get a palindrome (12231413221).
The spelling of 11130210110 in words is "eleven billion, one hundred thirty million, two hundred ten thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •