Base | Representation |
---|---|
bin | 111101101011000101… |
… | …1110001111001000011 |
3 | 110122212010210121010211 |
4 | 1323112023301321003 |
5 | 4132220230243133 |
6 | 140502044534551 |
7 | 12366022042366 |
oct | 1732613617103 |
9 | 418763717124 |
10 | 132442431043 |
11 | 5119433278a |
12 | 21802851457 |
13 | c648bc86c0 |
14 | 65a5a120dd |
15 | 36a24bbbcd |
hex | 1ed62f1e43 |
132442431043 has 8 divisors (see below), whose sum is σ = 142636919600. Its totient is φ = 122248886688.
The previous prime is 132442431007. The next prime is 132442431071. The reversal of 132442431043 is 340134244231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-132442431043 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 132442430996 and 132442431014.
It is not an unprimeable number, because it can be changed into a prime (132442434043) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 69988 + ... + 519406.
It is an arithmetic number, because the mean of its divisors is an integer number (17829614950).
Almost surely, 2132442431043 is an apocalyptic number.
132442431043 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
132442431043 is a deficient number, since it is larger than the sum of its proper divisors (10194488557).
132442431043 is a wasteful number, since it uses less digits than its factorization.
132442431043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 472101.
The product of its (nonzero) digits is 27648, while the sum is 31.
Adding to 132442431043 its reverse (340134244231), we get a palindrome (472576675274).
The spelling of 132442431043 in words is "one hundred thirty-two billion, four hundred forty-two million, four hundred thirty-one thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •