Base | Representation |
---|---|
bin | 100001001011000… |
… | …1110100011010111 |
3 | 2212120112111201221 |
4 | 1002112032203113 |
5 | 4234424414111 |
6 | 302242031211 |
7 | 36404250436 |
oct | 10226164327 |
9 | 2776474657 |
10 | 1113123031 |
11 | 521368899 |
12 | 270948507 |
13 | 1497c6ba7 |
14 | a7b9711d |
15 | 67ac9371 |
hex | 4258e8d7 |
1113123031 has 4 divisors (see below), whose sum is σ = 1119273064. Its totient is φ = 1106973000.
The previous prime is 1113123029. The next prime is 1113123073. The reversal of 1113123031 is 1303213111.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1113123031 - 21 = 1113123029 is a prime.
It is a super-2 number, since 2×11131230312 = 2478085764285253922, 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 = 1113122996 and 1113123014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1113123131) 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, 3074745 + ... + 3075106.
It is an arithmetic number, because the mean of its divisors is an integer number (279818266).
Almost surely, 21113123031 is an apocalyptic number.
1113123031 is a deficient number, since it is larger than the sum of its proper divisors (6150033).
1113123031 is an equidigital number, since it uses as much as digits as its factorization.
1113123031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6150032.
The product of its (nonzero) digits is 54, while the sum is 16.
The square root of 1113123031 is about 33363.4984826232. The cubic root of 1113123031 is about 1036.3689419925.
Adding to 1113123031 its reverse (1303213111), we get a palindrome (2416336142).
The spelling of 1113123031 in words is "one billion, one hundred thirteen million, one hundred twenty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •