Base | Representation |
---|---|
bin | 100001101110001… |
… | …0101011111100100 |
3 | 2220212010020022110 |
4 | 1003130111133210 |
5 | 4304131022130 |
6 | 304140001020 |
7 | 40016414211 |
oct | 10334253744 |
9 | 2825106273 |
10 | 1131501540 |
11 | 530780944 |
12 | 276b30170 |
13 | 150560250 |
14 | aa3bcb08 |
15 | 69509ab0 |
hex | 437157e4 |
1131501540 has 96 divisors (see below), whose sum is σ = 3424248576. Its totient is φ = 277516800.
The previous prime is 1131501493. The next prime is 1131501557. The reversal of 1131501540 is 451051311.
It is a happy number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 226065 + ... + 231015.
It is an arithmetic number, because the mean of its divisors is an integer number (35669256).
Almost surely, 21131501540 is an apocalyptic number.
1131501540 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1131501540, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1712124288).
1131501540 is an abundant number, since it is smaller than the sum of its proper divisors (2292747036).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1131501540 is a wasteful number, since it uses less digits than its factorization.
1131501540 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5269 (or 5267 counting only the distinct ones).
The product of its (nonzero) digits is 300, while the sum is 21.
The square root of 1131501540 is about 33637.7992740310. The cubic root of 1131501540 is about 1042.0415825768.
Adding to 1131501540 its reverse (451051311), we get a palindrome (1582552851).
The spelling of 1131501540 in words is "one billion, one hundred thirty-one million, five hundred one thousand, five hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •