Base | Representation |
---|---|
bin | 1001101000100010101… |
… | …01000000001001110000 |
3 | 1011122101011220202221221 |
4 | 10310101111000021300 |
5 | 20410343304400422 |
6 | 412021043154424 |
7 | 32625365531014 |
oct | 4642125001160 |
9 | 1148334822857 |
10 | 331003200112 |
11 | 11841774a432 |
12 | 54198375a14 |
13 | 252a0cb1630 |
14 | 120408cc544 |
15 | 89243ec3c7 |
hex | 4d11540270 |
331003200112 has 20 divisors (see below), whose sum is σ = 690650908360. Its totient is φ = 152770707648.
The previous prime is 331003200097. The next prime is 331003200127. The reversal of 331003200112 is 211002300133.
It is an interprime number because it is at equal distance from previous prime (331003200097) and next prime (331003200127).
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 795680562 + ... + 795680977.
It is an arithmetic number, because the mean of its divisors is an integer number (34532545418).
Almost surely, 2331003200112 is an apocalyptic number.
It is an amenable number.
331003200112 is an abundant number, since it is smaller than the sum of its proper divisors (359647708248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
331003200112 is a wasteful number, since it uses less digits than its factorization.
331003200112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1591361560 (or 1591361554 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 331003200112 its reverse (211002300133), we get a palindrome (542005500245).
The spelling of 331003200112 in words is "three hundred thirty-one billion, three million, two hundred thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •