Base | Representation |
---|---|
bin | 100001001011101… |
… | …0111100110010111 |
3 | 2212121002201011102 |
4 | 1002113113212113 |
5 | 4240014002411 |
6 | 302252300315 |
7 | 36406634645 |
oct | 10227274627 |
9 | 2777081142 |
10 | 1113422231 |
11 | 521552669 |
12 | 270a7169b |
13 | 1498a012c |
14 | a7c34195 |
15 | 67b37d3b |
hex | 425d7997 |
1113422231 has 4 divisors (see below), whose sum is σ = 1113914352. Its totient is φ = 1112930112.
The previous prime is 1113422227. The next prime is 1113422239. The reversal of 1113422231 is 1322243111.
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 1113422231 - 22 = 1113422227 is a prime.
It is a super-2 number, since 2×11134222312 = 2479418128970034722, 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 (1113422239) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 242651 + ... + 247196.
It is an arithmetic number, because the mean of its divisors is an integer number (278478588).
Almost surely, 21113422231 is an apocalyptic number.
1113422231 is a deficient number, since it is larger than the sum of its proper divisors (492121).
1113422231 is an equidigital number, since it uses as much as digits as its factorization.
1113422231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 492120.
The product of its digits is 288, while the sum is 20.
The square root of 1113422231 is about 33367.9821235867. The cubic root of 1113422231 is about 1036.4617900127.
Adding to 1113422231 its reverse (1322243111), we get a palindrome (2435665342).
The spelling of 1113422231 in words is "one billion, one hundred thirteen million, four hundred twenty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •