Base | Representation |
---|---|
bin | 100101100001010011101111… |
… | …1011010101010110000111101 |
3 | 1121021112212201020111010020100 |
4 | 1023002213133122222300331 |
5 | 321224231230024131023 |
6 | 3125531115135311313 |
7 | 126342056406104412 |
oct | 11302473732526075 |
9 | 1537485636433210 |
10 | 330033330302013 |
11 | 96182393005818 |
12 | 3102280667b539 |
13 | 11220017b6aa60 |
14 | 5b6d9ac654109 |
15 | 2824dce7ecc43 |
hex | 12c29df6aac3d |
330033330302013 has 24 divisors (see below), whose sum is σ = 513388287452768. Its totient is φ = 203096204896032.
The previous prime is 330033330301991. The next prime is 330033330302077. The reversal of 330033330302013 is 310203033330033.
330033330302013 is a `hidden beast` number, since 3 + 3 + 0 + 0 + 333 + 303 + 0 + 20 + 1 + 3 = 666.
It is not a de Polignac number, because 330033330302013 - 226 = 330033263193149 is a prime.
It is a super-2 number, since 2×3300333303020132 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (330033330302513) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 11071206 + ... + 27975672.
Almost surely, 2330033330302013 is an apocalyptic number.
It is an amenable number.
330033330302013 is a deficient number, since it is larger than the sum of its proper divisors (183354957150755).
330033330302013 is a wasteful number, since it uses less digits than its factorization.
330033330302013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17071353 (or 17071350 counting only the distinct ones).
The product of its (nonzero) digits is 13122, while the sum is 27.
Adding to 330033330302013 its reverse (310203033330033), we get a palindrome (640236363632046).
The spelling of 330033330302013 in words is "three hundred thirty trillion, thirty-three billion, three hundred thirty million, three hundred two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •