Base | Representation |
---|---|
bin | 1001101000110001111… |
… | …01010010010111101000 |
3 | 1011122201002202220011120 |
4 | 10310120331102113220 |
5 | 20411124041413000 |
6 | 412041454455240 |
7 | 32631511524315 |
oct | 4643075222750 |
9 | 1148632686146 |
10 | 331131201000 |
11 | 118482a26396 |
12 | 54213204520 |
13 | 252c167a1c2 |
14 | 120538cbd0c |
15 | 89307836a0 |
hex | 4d18f525e8 |
331131201000 has 64 divisors (see below), whose sum is σ = 1033129356480. Its totient is φ = 88301652800.
The previous prime is 331131200999. The next prime is 331131201007. The reversal of 331131201000 is 102131133.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is not an unprimeable number, because it can be changed into a prime (331131201007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 55185534 + ... + 55191533.
It is an arithmetic number, because the mean of its divisors is an integer number (16142646195).
Almost surely, 2331131201000 is an apocalyptic number.
331131201000 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
331131201000 is an abundant number, since it is smaller than the sum of its proper divisors (701998155480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
331131201000 is a wasteful number, since it uses less digits than its factorization.
331131201000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 110377091 (or 110377077 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 331131201000 its reverse (102131133), we get a palindrome (331233332133).
The spelling of 331131201000 in words is "three hundred thirty-one billion, one hundred thirty-one million, two hundred one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •