Base | Representation |
---|---|
bin | 100001001010111… |
… | …0101111010101011 |
3 | 2212120100101022121 |
4 | 1002111311322223 |
5 | 4234413201443 |
6 | 302235532111 |
7 | 36403350313 |
oct | 10225657253 |
9 | 2776311277 |
10 | 1113022123 |
11 | 5212a9aa4 |
12 | 2708ba037 |
13 | 14978cc95 |
14 | a7b6c443 |
15 | 67aa94ed |
hex | 42575eab |
1113022123 has 8 divisors (see below), whose sum is σ = 1145508480. Its totient is φ = 1080662400.
The previous prime is 1113022091. The next prime is 1113022159. The reversal of 1113022123 is 3212203111.
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 1113022123 - 25 = 1113022091 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1113022097 and 1113022106.
It is not an unprimeable number, because it can be changed into a prime (1113022423) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13678 + ... + 49123.
It is an arithmetic number, because the mean of its divisors is an integer number (143188560).
Almost surely, 21113022123 is an apocalyptic number.
1113022123 is a deficient number, since it is larger than the sum of its proper divisors (32486357).
1113022123 is an equidigital number, since it uses as much as digits as its factorization.
1113022123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63317.
The product of its (nonzero) digits is 72, while the sum is 16.
The square root of 1113022123 is about 33361.9861968678. The cubic root of 1113022123 is about 1036.3376243770.
Adding to 1113022123 its reverse (3212203111), we get a palindrome (4325225234).
The spelling of 1113022123 in words is "one billion, one hundred thirteen million, twenty-two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •