Base | Representation |
---|---|
bin | 11110000010010111110110… |
… | …001111001111011001001111 |
3 | 122022202001122120201202220022 |
4 | 132002113312033033121033 |
5 | 114303344343210012143 |
6 | 1144543535253212355 |
7 | 36553142116215314 |
oct | 3602276617173117 |
9 | 568661576652808 |
10 | 132104440313423 |
11 | 391021a6668326 |
12 | 129968859310bb |
13 | 589351a535386 |
14 | 2489c636bcd0b |
15 | 104151650e268 |
hex | 7825f63cf64f |
132104440313423 has 8 divisors (see below), whose sum is σ = 134396788540560. Its totient is φ = 129813868416960.
The previous prime is 132104440313359. The next prime is 132104440313449. The reversal of 132104440313423 is 324313044401231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 132104440313423 - 26 = 132104440313359 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132104440313473) 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, 443932640 + ... + 444230117.
It is an arithmetic number, because the mean of its divisors is an integer number (16799598567570).
Almost surely, 2132104440313423 is an apocalyptic number.
132104440313423 is a deficient number, since it is larger than the sum of its proper divisors (2292348227137).
132104440313423 is an equidigital number, since it uses as much as digits as its factorization.
132104440313423 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 888165337.
The product of its (nonzero) digits is 82944, while the sum is 35.
Adding to 132104440313423 its reverse (324313044401231), we get a palindrome (456417484714654).
The spelling of 132104440313423 in words is "one hundred thirty-two trillion, one hundred four billion, four hundred forty million, three hundred thirteen thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •