Base | Representation |
---|---|
bin | 10011101111001… |
… | …100111001000000 |
3 | 212002002200121100 |
4 | 103233030321000 |
5 | 1134233000142 |
6 | 52505254400 |
7 | 11130435462 |
oct | 2357147100 |
9 | 762080540 |
10 | 331140672 |
11 | 15aa13985 |
12 | 92a94400 |
13 | 537b2035 |
14 | 31d9c132 |
15 | 1e110b4c |
hex | 13bcce40 |
331140672 has 84 divisors (see below), whose sum is σ = 951794896. Its totient is φ = 110073600.
The previous prime is 331140631. The next prime is 331140679. The reversal of 331140672 is 276041133.
It is a super-3 number, since 3×3311406723 (a number of 27 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (331140679) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 314547 + ... + 315597.
Almost surely, 2331140672 is an apocalyptic number.
331140672 is a gapful number since it is divisible by the number (32) 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 331140672, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (475897448).
331140672 is an abundant number, since it is smaller than the sum of its proper divisors (620654224).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
331140672 is a wasteful number, since it uses less digits than its factorization.
331140672 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1616 (or 1603 counting only the distinct ones).
The product of its (nonzero) digits is 3024, while the sum is 27.
The square root of 331140672 is about 18197.2710041918. The cubic root of 331140672 is about 691.8376221413.
The spelling of 331140672 in words is "three hundred thirty-one million, one hundred forty thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •