Base | Representation |
---|---|
bin | 11110000010011111010101… |
… | …011101111000011100111001 |
3 | 122022202211101220122102110202 |
4 | 132002133111131320130321 |
5 | 114304012324443004243 |
6 | 1144551345145051545 |
7 | 36553545265153052 |
oct | 3602372535703471 |
9 | 568684356572422 |
10 | 132112480438073 |
11 | 39105652050a43 |
12 | 1299834a486bb5 |
13 | 58941cc186995 |
14 | 248a3c742d729 |
15 | 10418372d34b8 |
hex | 7827d5778739 |
132112480438073 has 8 divisors (see below), whose sum is σ = 135248203228296. Its totient is φ = 129012594480000.
The previous prime is 132112480438063. The next prime is 132112480438091. The reversal of 132112480438073 is 370834084211231.
It can be written as a sum of positive squares in 4 ways, for example, as 92874621573904 + 39237858864169 = 9637148^2 + 6264013^2 .
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 132112480438073 - 212 = 132112480433977 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (132112480438063) 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, 8959200578 + ... + 8959215323.
It is an arithmetic number, because the mean of its divisors is an integer number (16906025403537).
Almost surely, 2132112480438073 is an apocalyptic number.
It is an amenable number.
132112480438073 is a deficient number, since it is larger than the sum of its proper divisors (3135722790223).
132112480438073 is a wasteful number, since it uses less digits than its factorization.
132112480438073 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17918416075.
The product of its (nonzero) digits is 774144, while the sum is 47.
The spelling of 132112480438073 in words is "one hundred thirty-two trillion, one hundred twelve billion, four hundred eighty million, four hundred thirty-eight thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •