Base | Representation |
---|---|
bin | 100101101000101001001000… |
… | …1000111101000011000011101 |
3 | 1121102010020112202021200201202 |
4 | 1023101102101013220120131 |
5 | 321342240123001100404 |
6 | 3132022142301045245 |
7 | 126504642601150343 |
oct | 11321222107503035 |
9 | 1542106482250652 |
10 | 331041334003229 |
11 | 965309288a6913 |
12 | 31166040b56825 |
13 | 112940aa374275 |
14 | 5ba66b3a49993 |
15 | 2841228a4121e |
hex | 12d14911e861d |
331041334003229 has 8 divisors (see below), whose sum is σ = 334320066558720. Its totient is φ = 327762622930000.
The previous prime is 331041334003169. The next prime is 331041334003241. The reversal of 331041334003229 is 922300433140133.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 331041334003229 - 212 = 331041333999133 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 331041334003192 and 331041334003201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (331041334003529) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 26536112 + ... + 36962790.
It is an arithmetic number, because the mean of its divisors is an integer number (41790008319840).
Almost surely, 2331041334003229 is an apocalyptic number.
It is an amenable number.
331041334003229 is a deficient number, since it is larger than the sum of its proper divisors (3278732555491).
331041334003229 is a wasteful number, since it uses less digits than its factorization.
331041334003229 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10741131.
The product of its (nonzero) digits is 139968, while the sum is 38.
The spelling of 331041334003229 in words is "three hundred thirty-one trillion, forty-one billion, three hundred thirty-four million, three thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.034 sec. • engine limits •