Base | Representation |
---|---|
bin | 1001101000100111001… |
… | …01101010111010100010 |
3 | 1011122110211021111202110 |
4 | 10310103211222322202 |
5 | 20410433011432002 |
6 | 412024520100150 |
7 | 32626336061211 |
oct | 4642345527242 |
9 | 1148424244673 |
10 | 331041124002 |
11 | 1184370a2196 |
12 | 541a9004656 |
13 | 252a8acc1c4 |
14 | 12045961078 |
15 | 89278dde6c |
hex | 4d1396aea2 |
331041124002 has 8 divisors (see below), whose sum is σ = 662082248016. Its totient is φ = 110347041332.
The previous prime is 331041123989. The next prime is 331041124003. The reversal of 331041124002 is 200421140133.
It is a sphenic number, since it is the product of 3 distinct primes.
331041124002 is an admirable number.
It is a self number, because there is not a number n which added to its sum of digits gives 331041124002.
It is not an unprimeable number, because it can be changed into a prime (331041124003) 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 3 ways as a sum of consecutive naturals, for example, 27586760328 + ... + 27586760339.
It is an arithmetic number, because the mean of its divisors is an integer number (82760281002).
Almost surely, 2331041124002 is an apocalyptic number.
331041124002 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
331041124002 is a wasteful number, since it uses less digits than its factorization.
331041124002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55173520672.
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 331041124002 its reverse (200421140133), we get a palindrome (531462264135).
The spelling of 331041124002 in words is "three hundred thirty-one billion, forty-one million, one hundred twenty-four thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •