Base | Representation |
---|---|
bin | 11110000001010100100000… |
… | …001110000110010010101000 |
3 | 122022111011000011112002000222 |
4 | 132001110200032012102220 |
5 | 114301203300313304112 |
6 | 1144450420120545212 |
7 | 36545002161416150 |
oct | 3601244016062250 |
9 | 568434004462028 |
10 | 132032130213032 |
11 | 3908456a486685 |
12 | 12984865322208 |
13 | 588976561a41a |
14 | 2486563d69760 |
15 | 103e6d31d4372 |
hex | 7815203864a8 |
132032130213032 has 16 divisors (see below), whose sum is σ = 282925993313760. Its totient is φ = 56585198662704.
The previous prime is 132032130213017. The next prime is 132032130213059. The reversal of 132032130213032 is 230312031230231.
It is a junction number, because it is equal to n+sod(n) for n = 132032130212992 and 132032130213010.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1178858305418 + ... + 1178858305529.
It is an arithmetic number, because the mean of its divisors is an integer number (17682874582110).
Almost surely, 2132032130213032 is an apocalyptic number.
It is an amenable number.
132032130213032 is an abundant number, since it is smaller than the sum of its proper divisors (150893863100728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132032130213032 is a wasteful number, since it uses less digits than its factorization.
132032130213032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2357716610960 (or 2357716610956 counting only the distinct ones).
The product of its (nonzero) digits is 3888, while the sum is 26.
Adding to 132032130213032 its reverse (230312031230231), we get a palindrome (362344161443263).
The spelling of 132032130213032 in words is "one hundred thirty-two trillion, thirty-two billion, one hundred thirty million, two hundred thirteen thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •