Base | Representation |
---|---|
bin | 100001001001011… |
… | …0010011000101111 |
3 | 2212111211200200221 |
4 | 1002102302120233 |
5 | 4234212034411 |
6 | 302210432211 |
7 | 36363503332 |
oct | 10222623057 |
9 | 2774750627 |
10 | 1112221231 |
11 | 520902300 |
12 | 270592667 |
13 | 14956c594 |
14 | a7a00619 |
15 | 6799c071 |
hex | 424b262f |
1112221231 has 12 divisors (see below), whose sum is σ = 1227940056. Its totient is φ = 1006631120.
The previous prime is 1112221199. The next prime is 1112221241. The reversal of 1112221231 is 1321222111.
It is not a de Polignac number, because 1112221231 - 25 = 1112221199 is a prime.
It is a super-3 number, since 3×11122212313 (a number of 28 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1112221241) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 7221 + ... + 47713.
It is an arithmetic number, because the mean of its divisors is an integer number (102328338).
Almost surely, 21112221231 is an apocalyptic number.
1112221231 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1112221231 is a deficient number, since it is larger than the sum of its proper divisors (115718825).
1112221231 is a wasteful number, since it uses less digits than its factorization.
1112221231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 40742 (or 40731 counting only the distinct ones).
The product of its digits is 48, while the sum is 16.
The square root of 1112221231 is about 33349.9809745073. The cubic root of 1112221231 is about 1036.0889938980.
Adding to 1112221231 its reverse (1321222111), we get a palindrome (2433443342).
The spelling of 1112221231 in words is "one billion, one hundred twelve million, two hundred twenty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •