Base | Representation |
---|---|
bin | 100001000111110… |
… | …1101000100100111 |
3 | 2212110022122001121 |
4 | 1002033231010213 |
5 | 4234010204111 |
6 | 302141234411 |
7 | 36353566141 |
oct | 10217550447 |
9 | 2773278047 |
10 | 1111413031 |
11 | 520400073 |
12 | 270262a07 |
13 | 149348761 |
14 | a786dc91 |
15 | 6788c871 |
hex | 423ed127 |
1111413031 has 4 divisors (see below), whose sum is σ = 1130250600. Its totient is φ = 1092575464.
The previous prime is 1111413011. The next prime is 1111413041. The reversal of 1111413031 is 1303141111.
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 1111413031 - 211 = 1111410983 is a prime.
It is a super-2 number, since 2×11114130312 = 2470477850953213922, 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 = 1111412996 and 1111413014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1111413011) 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, 9418696 + ... + 9418813.
It is an arithmetic number, because the mean of its divisors is an integer number (282562650).
Almost surely, 21111413031 is an apocalyptic number.
1111413031 is a deficient number, since it is larger than the sum of its proper divisors (18837569).
1111413031 is an equidigital number, since it uses as much as digits as its factorization.
1111413031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18837568.
The product of its (nonzero) digits is 36, while the sum is 16.
The square root of 1111413031 is about 33337.8618240582. The cubic root of 1111413031 is about 1035.8379736846.
Adding to 1111413031 its reverse (1303141111), we get a palindrome (2414554142).
The spelling of 1111413031 in words is "one billion, one hundred eleven million, four hundred thirteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •