Base | Representation |
---|---|
bin | 111101100001101010… |
… | …1010110001110001001 |
3 | 110122001002200222100110 |
4 | 1323003111112032021 |
5 | 4131043300001131 |
6 | 140410430224533 |
7 | 12355131634443 |
oct | 1730325261611 |
9 | 418032628313 |
10 | 132126172041 |
11 | 51041863706 |
12 | 21734955149 |
13 | c5c85271b6 |
14 | 6575a09493 |
15 | 368484a646 |
hex | 1ec3556389 |
132126172041 has 8 divisors (see below), whose sum is σ = 176171005120. Its totient is φ = 88082726832.
The previous prime is 132126172027. The next prime is 132126172063. The reversal of 132126172041 is 140271621231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 132126172041 - 27 = 132126171913 is a prime.
It is a super-3 number, since 3×1321261720413 (a number of 34 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (132126172741) 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 7 ways as a sum of consecutive naturals, for example, 99646 + ... + 523623.
It is an arithmetic number, because the mean of its divisors is an integer number (22021375640).
Almost surely, 2132126172041 is an apocalyptic number.
It is an amenable number.
132126172041 is a deficient number, since it is larger than the sum of its proper divisors (44044833079).
132126172041 is an equidigital number, since it uses as much as digits as its factorization.
132126172041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 693935.
The product of its (nonzero) digits is 4032, while the sum is 30.
Adding to 132126172041 its reverse (140271621231), we get a palindrome (272397793272).
The spelling of 132126172041 in words is "one hundred thirty-two billion, one hundred twenty-six million, one hundred seventy-two thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •