Base | Representation |
---|---|
bin | 111101100001110100… |
… | …1101111111011001100 |
3 | 110122001110202200122120 |
4 | 1323003221233323030 |
5 | 4131101132121304 |
6 | 140411141012540 |
7 | 12355225250655 |
oct | 1730351577314 |
9 | 418043680576 |
10 | 132131520204 |
11 | 51044886882 |
12 | 217366b4150 |
13 | c5c967a5a8 |
14 | 65765dc52c |
15 | 36850550d9 |
hex | 1ec3a6fecc |
132131520204 has 12 divisors (see below), whose sum is σ = 308306880504. Its totient is φ = 44043840064.
The previous prime is 132131520197. The next prime is 132131520223. The reversal of 132131520204 is 402025131231.
132131520204 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (12).
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 3 ways as a sum of consecutive naturals, for example, 5505479997 + ... + 5505480020.
It is an arithmetic number, because the mean of its divisors is an integer number (25692240042).
Almost surely, 2132131520204 is an apocalyptic number.
It is an amenable number.
132131520204 is an abundant number, since it is smaller than the sum of its proper divisors (176175360300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132131520204 is a wasteful number, since it uses less digits than its factorization.
132131520204 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11010960024 (or 11010960022 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 24.
Adding to 132131520204 its reverse (402025131231), we get a palindrome (534156651435).
The spelling of 132131520204 in words is "one hundred thirty-two billion, one hundred thirty-one million, five hundred twenty thousand, two hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •