Base | Representation |
---|---|
bin | 100101100011010110000001… |
… | …1001011001111101110100000 |
3 | 1121022112121212002101111011021 |
4 | 1023012230003023033232200 |
5 | 321243322213344104440 |
6 | 3130303424505455224 |
7 | 126401222422545631 |
oct | 11306540313175640 |
9 | 1538477762344137 |
10 | 330313103113120 |
11 | 9628000050a686 |
12 | 31068a85aa1514 |
13 | 1124051320812a |
14 | 5b7d34d251888 |
15 | 282c30631584a |
hex | 12c6b032cfba0 |
330313103113120 has 48 divisors (see below), whose sum is σ = 780365931383808. Its totient is φ = 132125033790720.
The previous prime is 330313103113109. The next prime is 330313103113159. The reversal of 330313103113120 is 21311301313033.
It is a super-2 number, since 2×3303131031131202 (a number of 30 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 138150205 + ... + 140520835.
It is an arithmetic number, because the mean of its divisors is an integer number (16257623570496).
Almost surely, 2330313103113120 is an apocalyptic number.
It is an amenable number.
330313103113120 is an abundant number, since it is smaller than the sum of its proper divisors (450052828270688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
330313103113120 is a wasteful number, since it uses less digits than its factorization.
330313103113120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3241493 (or 3241485 counting only the distinct ones).
The product of its (nonzero) digits is 1458, while the sum is 25.
Adding to 330313103113120 its reverse (21311301313033), we get a palindrome (351624404426153).
The spelling of 330313103113120 in words is "three hundred thirty trillion, three hundred thirteen billion, one hundred three million, one hundred thirteen thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.331 sec. • engine limits •