Base | Representation |
---|---|
bin | 100001001011010… |
… | …1110010111011101 |
3 | 2212120210010111020 |
4 | 1002112232113131 |
5 | 4234443101331 |
6 | 302244514353 |
7 | 36405332364 |
oct | 10226562735 |
9 | 2776703436 |
10 | 1113253341 |
11 | 521447792 |
12 | 2709ab9b9 |
13 | 1498412b5 |
14 | a7bcc7db |
15 | 67b02c96 |
hex | 425ae5dd |
1113253341 has 4 divisors (see below), whose sum is σ = 1484337792. Its totient is φ = 742168892.
The previous prime is 1113253331. The next prime is 1113253343. The reversal of 1113253341 is 1433523111.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1113253341 - 27 = 1113253213 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1113253343) 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, 185542221 + ... + 185542226.
It is an arithmetic number, because the mean of its divisors is an integer number (371084448).
Almost surely, 21113253341 is an apocalyptic number.
It is an amenable number.
1113253341 is a deficient number, since it is larger than the sum of its proper divisors (371084451).
1113253341 is an equidigital number, since it uses as much as digits as its factorization.
1113253341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 371084450.
The product of its digits is 1080, while the sum is 24.
The square root of 1113253341 is about 33365.4513082020. The cubic root of 1113253341 is about 1036.4093819569.
Adding to 1113253341 its reverse (1433523111), we get a palindrome (2546776452).
The spelling of 1113253341 in words is "one billion, one hundred thirteen million, two hundred fifty-three thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •