Base | Representation |
---|---|
bin | 111101111100010011… |
… | …1001010000100110010 |
3 | 110201100101122211112010 |
4 | 1323320213022010302 |
5 | 4134411112031310 |
6 | 141035240543350 |
7 | 12416234425152 |
oct | 1737047120462 |
9 | 421311584463 |
10 | 133020033330 |
11 | 51460382948 |
12 | 21944181b56 |
13 | c70b7816c2 |
14 | 661c608762 |
15 | 36d8063320 |
hex | 1ef89ca132 |
133020033330 has 32 divisors (see below), whose sum is σ = 333128433024. Its totient is φ = 33929747456.
The previous prime is 133020033319. The next prime is 133020033359. The reversal of 133020033330 is 33330020331.
It is a super-2 number, since 2×1330200333302 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 133020033297 and 133020033306.
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 15 ways as a sum of consecutive naturals, for example, 96390639 + ... + 96392018.
It is an arithmetic number, because the mean of its divisors is an integer number (10410263532).
Almost surely, 2133020033330 is an apocalyptic number.
133020033330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
133020033330 is an abundant number, since it is smaller than the sum of its proper divisors (200108399694).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133020033330 is a wasteful number, since it uses less digits than its factorization.
133020033330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 192782690.
The product of its (nonzero) digits is 1458, while the sum is 21.
Adding to 133020033330 its reverse (33330020331), we get a palindrome (166350053661).
The spelling of 133020033330 in words is "one hundred thirty-three billion, twenty million, thirty-three thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •