Base | Representation |
---|---|
bin | 100001011010110… |
… | …0000100000010111 |
3 | 2220010222010000122 |
4 | 1002311200200113 |
5 | 4244024314111 |
6 | 303133502155 |
7 | 36534042233 |
oct | 10265404027 |
9 | 2803863018 |
10 | 1121323031 |
11 | 525a59654 |
12 | 27364195b |
13 | 14b40836a |
14 | a8ccd5c3 |
15 | 68698cdb |
hex | 42d60817 |
1121323031 has 4 divisors (see below), whose sum is σ = 1123755864. Its totient is φ = 1118890200.
The previous prime is 1121323001. The next prime is 1121323037. The reversal of 1121323031 is 1303231211.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1303231211 = 233 ⋅5593267.
It is a cyclic number.
It is not a de Polignac number, because 1121323031 - 230 = 47581207 is a prime.
It is a super-2 number, since 2×11213230312 = 2514730679702053922, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1121323037) 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, 1215725 + ... + 1216646.
It is an arithmetic number, because the mean of its divisors is an integer number (280938966).
Almost surely, 21121323031 is an apocalyptic number.
1121323031 is a deficient number, since it is larger than the sum of its proper divisors (2432833).
1121323031 is an equidigital number, since it uses as much as digits as its factorization.
1121323031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2432832.
The product of its (nonzero) digits is 108, while the sum is 17.
The square root of 1121323031 is about 33486.1617836383. The cubic root of 1121323031 is about 1038.9075779523.
Adding to 1121323031 its reverse (1303231211), we get a palindrome (2424554242).
The spelling of 1121323031 in words is "one billion, one hundred twenty-one million, three hundred twenty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •