Base | Representation |
---|---|
bin | 100001001011101… |
… | …1000010100111011 |
3 | 2212121002212020210 |
4 | 1002113120110323 |
5 | 4240014101321 |
6 | 302252322203 |
7 | 36406646433 |
oct | 10227302473 |
9 | 2777085223 |
10 | 1113425211 |
11 | 521554928 |
12 | 270a73363 |
13 | 1498a15b2 |
14 | a7c352c3 |
15 | 67b38b76 |
hex | 425d853b |
1113425211 has 4 divisors (see below), whose sum is σ = 1484566952. Its totient is φ = 742283472.
The previous prime is 1113425191. The next prime is 1113425231. The reversal of 1113425211 is 1125243111.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1125243111 = 3 ⋅375081037.
It is an interprime number because it is at equal distance from previous prime (1113425191) and next prime (1113425231).
It is not a de Polignac number, because 1113425211 - 27 = 1113425083 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1113425231) 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, 185570866 + ... + 185570871.
It is an arithmetic number, because the mean of its divisors is an integer number (371141738).
Almost surely, 21113425211 is an apocalyptic number.
1113425211 is a deficient number, since it is larger than the sum of its proper divisors (371141741).
1113425211 is an equidigital number, since it uses as much as digits as its factorization.
1113425211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 371141740.
The product of its digits is 240, while the sum is 21.
The square root of 1113425211 is about 33368.0267771410. The cubic root of 1113425211 is about 1036.4627146854.
Adding to 1113425211 its reverse (1125243111), we get a palindrome (2238668322).
The spelling of 1113425211 in words is "one billion, one hundred thirteen million, four hundred twenty-five thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •