Base | Representation |
---|---|
bin | 111101101011001001… |
… | …0001010100110001101 |
3 | 110122212020221122111222 |
4 | 1323112102022212031 |
5 | 4132221142330401 |
6 | 140502144453125 |
7 | 12366042214130 |
oct | 1732622124615 |
9 | 418766848458 |
10 | 132444105101 |
11 | 51195276500 |
12 | 2180331a1a5 |
13 | c649363679 |
14 | 65a5d2a217 |
15 | 36a26ecc1b |
hex | 1ed648a98d |
132444105101 has 72 divisors (see below), whose sum is σ = 172558447488. Its totient is φ = 99484862400.
The previous prime is 132444105091. The next prime is 132444105113. The reversal of 132444105101 is 101501444231.
It is a de Polignac number, because none of the positive numbers 2k-132444105101 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132444125101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 132842135 + ... + 132843131.
It is an arithmetic number, because the mean of its divisors is an integer number (2396645104).
Almost surely, 2132444105101 is an apocalyptic number.
132444105101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
132444105101 is a deficient number, since it is larger than the sum of its proper divisors (40114342387).
132444105101 is an equidigital number, since it uses as much as digits as its factorization.
132444105101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1191 (or 1133 counting only the distinct ones).
The product of its (nonzero) digits is 1920, while the sum is 26.
Adding to 132444105101 its reverse (101501444231), we get a palindrome (233945549332).
The spelling of 132444105101 in words is "one hundred thirty-two billion, four hundred forty-four million, one hundred five thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •