Base | Representation |
---|---|
bin | 100001001011000… |
… | …1011011011001110 |
3 | 2212120111212011112 |
4 | 1002112023123032 |
5 | 4234424011342 |
6 | 302241452022 |
7 | 36404165210 |
oct | 10226133316 |
9 | 2776455145 |
10 | 1113110222 |
11 | 52135a204 |
12 | 270941012 |
13 | 1497c1103 |
14 | a7b925b0 |
15 | 67ac5682 |
hex | 4258b6ce |
1113110222 has 8 divisors (see below), whose sum is σ = 1908188976. Its totient is φ = 477047232.
The previous prime is 1113110221. The next prime is 1113110227. The reversal of 1113110222 is 2220113111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (14), and also a Moran number because the ratio is a prime number: 79507873 = 1113110222 / (1 + 1 + 1 + 3 + 1 + 1 + 0 + 2 + 2 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 1113110197 and 1113110206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1113110221) 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, 39753923 + ... + 39753950.
It is an arithmetic number, because the mean of its divisors is an integer number (238523622).
Almost surely, 21113110222 is an apocalyptic number.
1113110222 is a deficient number, since it is larger than the sum of its proper divisors (795078754).
1113110222 is an equidigital number, since it uses as much as digits as its factorization.
1113110222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 79507882.
The product of its (nonzero) digits is 24, while the sum is 14.
The square root of 1113110222 is about 33363.3065207872. The cubic root of 1113110222 is about 1036.3649667205.
Adding to 1113110222 its reverse (2220113111), we get a palindrome (3333223333).
The spelling of 1113110222 in words is "one billion, one hundred thirteen million, one hundred ten thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •