Base | Representation |
---|---|
bin | 1001100111011011010… |
… | …00011110001100100011 |
3 | 1011120211110000201120001 |
4 | 10303231220132030203 |
5 | 20403132001333011 |
6 | 411441411200431 |
7 | 32604504262630 |
oct | 4635550361443 |
9 | 1146743021501 |
10 | 330404324131 |
11 | 11813a69a002 |
12 | 5404b8a6117 |
13 | 25206bba54b |
14 | 11dc5159187 |
15 | 88dba527c1 |
hex | 4ceda1e323 |
330404324131 has 8 divisors (see below), whose sum is σ = 394022548224. Its totient is φ = 270890501640.
The previous prime is 330404324101. The next prime is 330404324167. The reversal of 330404324131 is 131423404033.
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 330404324131 - 25 = 330404324099 is a prime.
It is a super-2 number, since 2×3304043241312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 330404324131.
It is not an unprimeable number, because it can be changed into a prime (330404324101) 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, 1026100225 + ... + 1026100546.
It is an arithmetic number, because the mean of its divisors is an integer number (49252818528).
Almost surely, 2330404324131 is an apocalyptic number.
330404324131 is a deficient number, since it is larger than the sum of its proper divisors (63618224093).
330404324131 is a wasteful number, since it uses less digits than its factorization.
330404324131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2052200801.
The product of its (nonzero) digits is 10368, while the sum is 28.
Adding to 330404324131 its reverse (131423404033), we get a palindrome (461827728164).
The spelling of 330404324131 in words is "three hundred thirty billion, four hundred four million, three hundred twenty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •