Base | Representation |
---|---|
bin | 111101100001001011… |
… | …1101110110110110101 |
3 | 110121222222022100221111 |
4 | 1323002113232312311 |
5 | 4131030131120041 |
6 | 140405052115021 |
7 | 12354544433140 |
oct | 1730227566665 |
9 | 417888270844 |
10 | 132110020021 |
11 | 51033731431 |
12 | 2172b465a71 |
13 | c5c50903a5 |
14 | 6573803057 |
15 | 3683209981 |
hex | 1ec25eedb5 |
132110020021 has 8 divisors (see below), whose sum is σ = 154494110144. Its totient is φ = 110603737440.
The previous prime is 132110020001. The next prime is 132110020127. The reversal of 132110020021 is 120020011231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 132110020021 - 27 = 132110019893 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 132110019983 and 132110020010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132110020001) by changing a digit.
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, 219451560 + ... + 219452161.
It is an arithmetic number, because the mean of its divisors is an integer number (19311763768).
Almost surely, 2132110020021 is an apocalyptic number.
It is an amenable number.
132110020021 is a deficient number, since it is larger than the sum of its proper divisors (22384090123).
132110020021 is an equidigital number, since it uses as much as digits as its factorization.
132110020021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 438903771.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 132110020021 its reverse (120020011231), we get a palindrome (252130031252).
The spelling of 132110020021 in words is "one hundred thirty-two billion, one hundred ten million, twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •