Base | Representation |
---|---|
bin | 100001011101111… |
… | …1100110110111111 |
3 | 2220021010220220012 |
4 | 1002323330312333 |
5 | 4244442341111 |
6 | 303234013435 |
7 | 36554305361 |
oct | 10273746677 |
9 | 2807126805 |
10 | 1123012031 |
11 | 526a02619 |
12 | 27411727b |
13 | 14b87a07b |
14 | a920cd31 |
15 | 688ce48b |
hex | 42efcdbf |
1123012031 has 8 divisors (see below), whose sum is σ = 1158266304. Its totient is φ = 1088231200.
The previous prime is 1123012021. The next prime is 1123012039. The reversal of 1123012031 is 1302103211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1123012031 is a prime.
It is a super-2 number, since 2×11230120312 = 2522312043541489922, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1123011997 and 1123012015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1123012039) 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, 113540 + ... + 123033.
It is an arithmetic number, because the mean of its divisors is an integer number (144783288).
Almost surely, 21123012031 is an apocalyptic number.
1123012031 is a deficient number, since it is larger than the sum of its proper divisors (35254273).
1123012031 is a wasteful number, since it uses less digits than its factorization.
1123012031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 236721.
The product of its (nonzero) digits is 36, while the sum is 14.
The square root of 1123012031 is about 33511.3716669431. The cubic root of 1123012031 is about 1039.4289366718.
Adding to 1123012031 its reverse (1302103211), we get a palindrome (2425115242).
The spelling of 1123012031 in words is "one billion, one hundred twenty-three million, twelve thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •