Base | Representation |
---|---|
bin | 100111101011000… |
… | …1110011110011000 |
3 | 10102202221022110221 |
4 | 1033112032132120 |
5 | 10211243222040 |
6 | 340032445424 |
7 | 44663144611 |
oct | 11726163630 |
9 | 3382838427 |
10 | 1331226520 |
11 | 623496208 |
12 | 3119a9874 |
13 | 182a4c300 |
14 | c8b2cc08 |
15 | 7bd0c74a |
hex | 4f58e798 |
1331226520 has 48 divisors (see below), whose sum is σ = 3243404160. Its totient is φ = 491527296.
The previous prime is 1331226517. The next prime is 1331226563. The reversal of 1331226520 is 256221331.
It is a super-3 number, since 3×13312265203 (a number of 28 digits) contains 333 as substring.
It is a congruent number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 91704 + ... + 105223.
It is an arithmetic number, because the mean of its divisors is an integer number (67570920).
Almost surely, 21331226520 is an apocalyptic number.
1331226520 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1331226520 is an abundant number, since it is smaller than the sum of its proper divisors (1912177640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1331226520 is a wasteful number, since it uses less digits than its factorization.
1331226520 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 196964 (or 196947 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 25.
The square root of 1331226520 is about 36485.9770322791. The cubic root of 1331226520 is about 1100.0623986642.
Adding to 1331226520 its reverse (256221331), we get a palindrome (1587447851).
The spelling of 1331226520 in words is "one billion, three hundred thirty-one million, two hundred twenty-six thousand, five hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.028 sec. • engine limits •