Base | Representation |
---|---|
bin | 111101100011111001… |
… | …0111010100111000010 |
3 | 110122020022120021002100 |
4 | 1323013302322213002 |
5 | 4131221431012010 |
6 | 140422102531230 |
7 | 12360031142436 |
oct | 1730762724702 |
9 | 418208507070 |
10 | 132201032130 |
11 | 51080044152 |
12 | 21755a36b16 |
13 | c60aba7bcb |
14 | 65819349c6 |
15 | 368b1d62c0 |
hex | 1ec7cba9c2 |
132201032130 has 48 divisors (see below), whose sum is σ = 344488318200. Its totient is φ = 35175081984.
The previous prime is 132201032087. The next prime is 132201032137. The reversal of 132201032130 is 31230102231.
It can be written as a sum of positive squares in 4 ways, for example, as 129368983041 + 2832049089 = 359679^2 + 53217^2 .
It is a super-2 number, since 2×1322010321302 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (132201032137) 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, 1595337 + ... + 1676156.
Almost surely, 2132201032130 is an apocalyptic number.
132201032130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
132201032130 is an abundant number, since it is smaller than the sum of its proper divisors (212287286070).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132201032130 is a wasteful number, since it uses less digits than its factorization.
132201032130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3271955 (or 3271952 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 132201032130 its reverse (31230102231), we get a palindrome (163431134361).
The spelling of 132201032130 in words is "one hundred thirty-two billion, two hundred one million, thirty-two thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •