Base | Representation |
---|---|
bin | 111101101011001001… |
… | …1010010110101111110 |
3 | 110122212021111200110000 |
4 | 1323112103102311332 |
5 | 4132221231313042 |
6 | 140502155055130 |
7 | 12366044555643 |
oct | 1732623226576 |
9 | 418767450400 |
10 | 132444401022 |
11 | 5119545886a |
12 | 218034414a6 |
13 | c64943827b |
14 | 65a5da5dca |
15 | 36a275a74c |
hex | 1ed64d2d7e |
132444401022 has 80 divisors (see below), whose sum is σ = 307122968592. Its totient is φ = 42626787840.
The previous prime is 132444400987. The next prime is 132444401051. The reversal of 132444401022 is 220104444231.
132444401022 is a `hidden beast` number, since 13 + 244 + 4 + 401 + 0 + 2 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
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 39 ways as a sum of consecutive naturals, for example, 700878 + ... + 869550.
Almost surely, 2132444401022 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 132444401022, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (153561484296).
132444401022 is an abundant number, since it is smaller than the sum of its proper divisors (174678567570).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132444401022 is a wasteful number, since it uses less digits than its factorization.
132444401022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 168855 (or 168846 counting only the distinct ones).
The product of its (nonzero) digits is 6144, while the sum is 27.
Adding to 132444401022 its reverse (220104444231), we get a palindrome (352548845253).
The spelling of 132444401022 in words is "one hundred thirty-two billion, four hundred forty-four million, four hundred one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •