Base | Representation |
---|---|
bin | 11110000001010101010101… |
… | …011000001011111011010101 |
3 | 122022111020022022200002100222 |
4 | 132001111111120023323111 |
5 | 114301212112121100010 |
6 | 1144451044420044125 |
7 | 36545033241046016 |
oct | 3601252530137325 |
9 | 568436268602328 |
10 | 132033022050005 |
11 | 39084987942a2a |
12 | 12984a73b33645 |
13 | 58898783163cb |
14 | 248660a59d00d |
15 | 103e73664c355 |
hex | 78155560bed5 |
132033022050005 has 8 divisors (see below), whose sum is σ = 158498547869400. Its totient is φ = 105587136700416.
The previous prime is 132033022049993. The next prime is 132033022050031. The reversal of 132033022050005 is 500050220330231.
It can be written as a sum of positive squares in 4 ways, for example, as 13575201278116 + 118457820771889 = 3684454^2 + 10883833^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 132033022050005 - 26 = 132033022049941 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4910102660 + ... + 4910129549.
It is an arithmetic number, because the mean of its divisors is an integer number (19812318483675).
Almost surely, 2132033022050005 is an apocalyptic number.
It is an amenable number.
132033022050005 is a deficient number, since it is larger than the sum of its proper divisors (26465525819395).
132033022050005 is an equidigital number, since it uses as much as digits as its factorization.
132033022050005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9820234903.
The product of its (nonzero) digits is 5400, while the sum is 26.
Adding to 132033022050005 its reverse (500050220330231), we get a palindrome (632083242380236).
The spelling of 132033022050005 in words is "one hundred thirty-two trillion, thirty-three billion, twenty-two million, fifty thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •