Base | Representation |
---|---|
bin | 100101100011010000011000… |
… | …1110010010110001000010100 |
3 | 1121022111110121121122110101201 |
4 | 1023012200301302112020110 |
5 | 321243122422023304022 |
6 | 3130254103522402244 |
7 | 126400313461600603 |
oct | 11306406162261024 |
9 | 1538443547573351 |
10 | 330301000213012 |
11 | 9627595a7666a4 |
12 | 31066668800384 |
13 | 1123c334955a8a |
14 | 5b7c921ac9a3a |
15 | 282bd48a1b127 |
hex | 12c6831c96214 |
330301000213012 has 24 divisors (see below), whose sum is σ = 590335744884480. Its totient is φ = 161633770163040.
The previous prime is 330301000213001. The next prime is 330301000213057. The reversal of 330301000213012 is 210312000103033.
It is a super-2 number, since 2×3303010002130122 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 5140539 + ... + 26211202.
It is an arithmetic number, because the mean of its divisors is an integer number (24597322703520).
Almost surely, 2330301000213012 is an apocalyptic number.
It is an amenable number.
330301000213012 is a deficient number, since it is larger than the sum of its proper divisors (260034744671468).
330301000213012 is a wasteful number, since it uses less digits than its factorization.
330301000213012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31407831 (or 31407829 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 330301000213012 its reverse (210312000103033), we get a palindrome (540613000316045).
It can be divided in two parts, 33030100021 and 3012, that added together give a palindrome (33030103033).
The spelling of 330301000213012 in words is "three hundred thirty trillion, three hundred one billion, two hundred thirteen thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •