Base | Representation |
---|---|
bin | 100111101001111… |
… | …1000000001000000 |
3 | 10102201210000002202 |
4 | 1033103320001000 |
5 | 10211114011430 |
6 | 340011332332 |
7 | 44655000101 |
oct | 11723700100 |
9 | 3381700082 |
10 | 1330610240 |
11 | 623105193 |
12 | 3117510a8 |
13 | 18289494b |
14 | c8a0c3a8 |
15 | 7bc39d45 |
hex | 4f4f8040 |
1330610240 has 28 divisors (see below), whose sum is σ = 3168516396. Its totient is φ = 532243968.
The previous prime is 1330610233. The next prime is 1330610251. The reversal of 1330610240 is 420160331.
It can be written as a sum of positive squares in 2 ways, for example, as 900960256 + 429649984 = 30016^2 + 20728^2 .
It is a super-2 number, since 2×13306102402 = 3541047221585715200, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2078759 + ... + 2079398.
Almost surely, 21330610240 is an apocalyptic number.
1330610240 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1330610240 is an abundant number, since it is smaller than the sum of its proper divisors (1837906156).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1330610240 is an equidigital number, since it uses as much as digits as its factorization.
1330610240 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4158174 (or 4158164 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 20.
The square root of 1330610240 is about 36477.5306181764. The cubic root of 1330610240 is about 1099.8926176168.
Adding to 1330610240 its reverse (420160331), we get a palindrome (1750770571).
The spelling of 1330610240 in words is "one billion, three hundred thirty million, six hundred ten thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •