Base | Representation |
---|---|
bin | 100001000101011… |
… | …0011111000100101 |
3 | 2212100220110100211 |
4 | 1002022303320211 |
5 | 4233143131323 |
6 | 302053535421 |
7 | 36336644143 |
oct | 10212637045 |
9 | 2770813324 |
10 | 1110130213 |
11 | 51a704295 |
12 | 26b944571 |
13 | 148cb98aa |
14 | a7618593 |
15 | 676d770d |
hex | 422b3e25 |
1110130213 has 8 divisors (see below), whose sum is σ = 1158789888. Its totient is φ = 1061503344.
The previous prime is 1110130211. The next prime is 1110130247. The reversal of 1110130213 is 3120310111.
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 1110130213 - 21 = 1110130211 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1110130193 and 1110130202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1110130211) 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, 82356 + ... + 94882.
It is an arithmetic number, because the mean of its divisors is an integer number (144848736).
Almost surely, 21110130213 is an apocalyptic number.
It is an amenable number.
1110130213 is a deficient number, since it is larger than the sum of its proper divisors (48659675).
1110130213 is a wasteful number, since it uses less digits than its factorization.
1110130213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16403.
The product of its (nonzero) digits is 18, while the sum is 13.
The square root of 1110130213 is about 33318.6166129388. The cubic root of 1110130213 is about 1035.4392910679.
Adding to 1110130213 its reverse (3120310111), we get a palindrome (4230440324).
It can be divided in two parts, 11101 and 30213, that added together give a palindrome (41314).
The spelling of 1110130213 in words is "one billion, one hundred ten million, one hundred thirty thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •