Base | Representation |
---|---|
bin | 111110101011011101… |
… | …0100000001101101101 |
3 | 110212102122201100111021 |
4 | 1331112322200031231 |
5 | 4201131123204203 |
6 | 141500235254141 |
7 | 12503365336231 |
oct | 1752672401555 |
9 | 425378640437 |
10 | 134602163053 |
11 | 520a2459376 |
12 | 22105baa351 |
13 | c90149b537 |
14 | 672c7aa5c1 |
15 | 377bdd25bd |
hex | 1f56ea036d |
134602163053 has 4 divisors (see below), whose sum is σ = 134603575648. Its totient is φ = 134600750460.
The previous prime is 134602163027. The next prime is 134602163089. The reversal of 134602163053 is 350361206431.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 350361206431 = 31 ⋅11301974401.
It is a cyclic number.
It is not a de Polignac number, because 134602163053 - 217 = 134602031981 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 (134602163953) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 552153 + ... + 757678.
It is an arithmetic number, because the mean of its divisors is an integer number (33650893912).
Almost surely, 2134602163053 is an apocalyptic number.
It is an amenable number.
134602163053 is a deficient number, since it is larger than the sum of its proper divisors (1412595).
134602163053 is a wasteful number, since it uses less digits than its factorization.
134602163053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1412594.
The product of its (nonzero) digits is 38880, while the sum is 34.
Adding to 134602163053 its reverse (350361206431), we get a palindrome (484963369484).
The spelling of 134602163053 in words is "one hundred thirty-four billion, six hundred two million, one hundred sixty-three thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •