Base | Representation |
---|---|
bin | 111101100011111001… |
… | …0111010111001110010 |
3 | 110122020022120022201210 |
4 | 1323013302322321302 |
5 | 4131221431031310 |
6 | 140422102540550 |
7 | 12360031146102 |
oct | 1730762727162 |
9 | 418208508653 |
10 | 132201033330 |
11 | 51080045043 |
12 | 21755a37756 |
13 | c60aba8612 |
14 | 6581935202 |
15 | 368b1d6820 |
hex | 1ec7cbae72 |
132201033330 has 16 divisors (see below), whose sum is σ = 317282480064. Its totient is φ = 35253608880.
The previous prime is 132201033319. The next prime is 132201033359. The reversal of 132201033330 is 33330102231.
It is a super-2 number, since 2×1322010333302 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 132201033297 and 132201033306.
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, 2203350526 + ... + 2203350585.
It is an arithmetic number, because the mean of its divisors is an integer number (19830155004).
Almost surely, 2132201033330 is an apocalyptic number.
132201033330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
132201033330 is an abundant number, since it is smaller than the sum of its proper divisors (185081446734).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132201033330 is a wasteful number, since it uses less digits than its factorization.
132201033330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4406701121.
The product of its (nonzero) digits is 972, while the sum is 21.
Adding to 132201033330 its reverse (33330102231), we get a palindrome (165531135561).
The spelling of 132201033330 in words is "one hundred thirty-two billion, two hundred one million, thirty-three thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •