Base | Representation |
---|---|
bin | 100001001011001… |
… | …0000100100111101 |
3 | 2212120112221010010 |
4 | 1002112100210331 |
5 | 4234430200300 |
6 | 302242133433 |
7 | 36404313555 |
oct | 10226204475 |
9 | 2776487103 |
10 | 1113131325 |
11 | 521374049 |
12 | 270951279 |
13 | 1497ca8b7 |
14 | a7b9a165 |
15 | 67acba50 |
hex | 4259093d |
1113131325 has 48 divisors (see below), whose sum is σ = 1889609216. Its totient is φ = 577886400.
The previous prime is 1113131323. The next prime is 1113131333. The reversal of 1113131325 is 5231313111.
It is not a de Polignac number, because 1113131325 - 21 = 1113131323 is a prime.
It is a super-2 number, since 2×11131313252 = 2478122693392511250, 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 (1113131323) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1763760 + ... + 1764390.
Almost surely, 21113131325 is an apocalyptic number.
1113131325 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1113131325 is a deficient number, since it is larger than the sum of its proper divisors (776477891).
1113131325 is a wasteful number, since it uses less digits than its factorization.
1113131325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1234 (or 1229 counting only the distinct ones).
The product of its digits is 270, while the sum is 21.
The square root of 1113131325 is about 33363.6227799081. The cubic root of 1113131325 is about 1036.3715160185.
Adding to 1113131325 its reverse (5231313111), we get a palindrome (6344444436).
The spelling of 1113131325 in words is "one billion, one hundred thirteen million, one hundred thirty-one thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •