Base | Representation |
---|---|
bin | 1111000110010000011000… |
… | …01101110000010010011010 |
3 | 11100112220210010202112022212 |
4 | 13203020030031300102122 |
5 | 13322423204321132310 |
6 | 154340001440315122 |
7 | 6664433302561616 |
oct | 743101415602232 |
9 | 140486703675285 |
10 | 33200302130330 |
11 | a640195027a15 |
12 | 3882536012aa2 |
13 | 156aa0ca5395a |
14 | 82ac90530346 |
15 | 3c8939272205 |
hex | 1e320c37049a |
33200302130330 has 8 divisors (see below), whose sum is σ = 59760543834612. Its totient is φ = 13280120852128.
The previous prime is 33200302130327. The next prime is 33200302130341. The reversal of 33200302130330 is 3303120300233.
It can be written as a sum of positive squares in 2 ways, for example, as 32126258008009 + 1074044122321 = 5668003^2 + 1036361^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×332003021303302 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 33200302130296 and 33200302130305.
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 3 ways as a sum of consecutive naturals, for example, 1660015106507 + ... + 1660015106526.
Almost surely, 233200302130330 is an apocalyptic number.
33200302130330 is a deficient number, since it is larger than the sum of its proper divisors (26560241704282).
33200302130330 is a wasteful number, since it uses less digits than its factorization.
33200302130330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3320030213040.
The product of its (nonzero) digits is 2916, while the sum is 23.
Adding to 33200302130330 its reverse (3303120300233), we get a palindrome (36503422430563).
The spelling of 33200302130330 in words is "thirty-three trillion, two hundred billion, three hundred two million, one hundred thirty thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •