Base | Representation |
---|---|
bin | 100001001011001… |
… | …0000100011101000 |
3 | 2212120112220222222 |
4 | 1002112100203220 |
5 | 4234430144430 |
6 | 302242133212 |
7 | 36404313404 |
oct | 10226204350 |
9 | 2776486888 |
10 | 1113131240 |
11 | 521373a81 |
12 | 270951208 |
13 | 1497ca850 |
14 | a7b9a104 |
15 | 67acb9e5 |
hex | 425908e8 |
1113131240 has 32 divisors (see below), whose sum is σ = 2697203880. Its totient is φ = 411002112.
The previous prime is 1113131231. The next prime is 1113131297. The reversal of 1113131240 is 421313111.
It can be written as a sum of positive squares in 4 ways, for example, as 873438916 + 239692324 = 29554^2 + 15482^2 .
It is a super-2 number, since 2×11131312402 = 2478122314927875200, which contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1069799 + ... + 1070838.
Almost surely, 21113131240 is an apocalyptic number.
1113131240 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1113131240 is an abundant number, since it is smaller than the sum of its proper divisors (1584072640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1113131240 is a wasteful number, since it uses less digits than its factorization.
1113131240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2140661 (or 2140657 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 17.
The square root of 1113131240 is about 33363.6215060656. The cubic root of 1113131240 is about 1036.3714896390.
Adding to 1113131240 its reverse (421313111), we get a palindrome (1534444351).
The spelling of 1113131240 in words is "one billion, one hundred thirteen million, one hundred thirty-one thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.128 sec. • engine limits •