Base | Representation |
---|---|
bin | 100001001101001… |
… | …1101000110110101 |
3 | 2212122121210220000 |
4 | 1002122131012311 |
5 | 4240220344341 |
6 | 302321501513 |
7 | 36416544345 |
oct | 10232350665 |
9 | 2778553800 |
10 | 1114231221 |
11 | 521a55454 |
12 | 2711a1899 |
13 | 149ac441c |
14 | a7da4d25 |
15 | 67c478b6 |
hex | 4269d1b5 |
1114231221 has 20 divisors (see below), whose sum is σ = 1762380972. Its totient is φ = 699124608.
The previous prime is 1114231213. The next prime is 1114231253. The reversal of 1114231221 is 1221324111.
It can be written as a sum of positive squares in 2 ways, for example, as 741200625 + 373030596 = 27225^2 + 19314^2 .
It is not a de Polignac number, because 1114231221 - 23 = 1114231213 is a prime.
It is a super-2 number, since 2×11142312212 = 2483022427702301682, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1114231194 and 1114231203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1114231271) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 403210 + ... + 405963.
Almost surely, 21114231221 is an apocalyptic number.
It is an amenable number.
1114231221 is a deficient number, since it is larger than the sum of its proper divisors (648149751).
1114231221 is an equidigital number, since it uses as much as digits as its factorization.
1114231221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 809202 (or 809193 counting only the distinct ones).
The product of its digits is 96, while the sum is 18.
The square root of 1114231221 is about 33380.1021718029. The cubic root of 1114231221 is about 1036.7127532760.
Adding to 1114231221 its reverse (1221324111), we get a palindrome (2335555332).
The spelling of 1114231221 in words is "one billion, one hundred fourteen million, two hundred thirty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •