Base | Representation |
---|---|
bin | 10011101110101… |
… | …101010010101000 |
3 | 212001212010001120 |
4 | 103232231102220 |
5 | 1134214324430 |
6 | 52502415240 |
7 | 11126356230 |
oct | 2356552250 |
9 | 761763046 |
10 | 331011240 |
11 | 15a93570a |
12 | 92a31520 |
13 | 53768151 |
14 | 31d66cc0 |
15 | 1e0d7610 |
hex | 13bad4a8 |
331011240 has 128 divisors (see below), whose sum is σ = 1154304000. Its totient is φ = 74366208.
The previous prime is 331011167. The next prime is 331011251. The reversal of 331011240 is 42110133.
It is a Harshad number since it is a multiple of its sum of digits (15).
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, 46221 + ... + 52899.
It is an arithmetic number, because the mean of its divisors is an integer number (9018000).
Almost surely, 2331011240 is an apocalyptic number.
331011240 is a gapful number since it is divisible by the number (30) 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 331011240, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (577152000).
331011240 is an abundant number, since it is smaller than the sum of its proper divisors (823292760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
331011240 is a wasteful number, since it uses less digits than its factorization.
331011240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6759 (or 6755 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
The square root of 331011240 is about 18193.7142991749. The cubic root of 331011240 is about 691.7474715356.
Adding to 331011240 its reverse (42110133), we get a palindrome (373121373).
The spelling of 331011240 in words is "three hundred thirty-one million, eleven thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •