Base | Representation |
---|---|
bin | 111101100111001101… |
… | …0001110110111100110 |
3 | 110122112001101010011100 |
4 | 1323032122032313212 |
5 | 4131433333031042 |
6 | 140441105220530 |
7 | 12362546314014 |
oct | 1731632166746 |
9 | 418461333140 |
10 | 132312002022 |
11 | 51127748502 |
12 | 21787031746 |
13 | c627b8c875 |
14 | 659257d8b4 |
15 | 3695d0624c |
hex | 1ece68ede6 |
132312002022 has 48 divisors (see below), whose sum is σ = 289835807040. Its totient is φ = 43618848000.
The previous prime is 132312002021. The next prime is 132312002027. The reversal of 132312002022 is 220200213231.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 132312001986 and 132312002004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132312002021) 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 23 ways as a sum of consecutive naturals, for example, 1616254 + ... + 1696142.
It is an arithmetic number, because the mean of its divisors is an integer number (6038245980).
Almost surely, 2132312002022 is an apocalyptic number.
132312002022 is an abundant number, since it is smaller than the sum of its proper divisors (157523805018).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132312002022 is a wasteful number, since it uses less digits than its factorization.
132312002022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80909 (or 80906 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 132312002022 its reverse (220200213231), we get a palindrome (352512215253).
The spelling of 132312002022 in words is "one hundred thirty-two billion, three hundred twelve million, two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •