Base | Representation |
---|---|
bin | 111110100001101101… |
… | …1000110100110100001 |
3 | 110211120212102002220121 |
4 | 1331003123012212201 |
5 | 4144443420231302 |
6 | 141403554440241 |
7 | 12462315032011 |
oct | 1750333064641 |
9 | 424525362817 |
10 | 134275164577 |
11 | 51a449145a4 |
12 | 22034593081 |
13 | c87b809a08 |
14 | 66db1a9c41 |
15 | 375d33de37 |
hex | 1f436c69a1 |
134275164577 has 8 divisors (see below), whose sum is σ = 134434788480. Its totient is φ = 134115589440.
The previous prime is 134275164553. The next prime is 134275164601. The reversal of 134275164577 is 775461572431.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (134275164553) and next prime (134275164601).
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 134275164577 - 211 = 134275162529 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (134275164077) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10963177 + ... + 10975417.
It is an arithmetic number, because the mean of its divisors is an integer number (16804348560).
Almost surely, 2134275164577 is an apocalyptic number.
It is an amenable number.
134275164577 is a deficient number, since it is larger than the sum of its proper divisors (159623903).
134275164577 is a wasteful number, since it uses less digits than its factorization.
134275164577 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24383.
The product of its digits is 4939200, while the sum is 52.
The spelling of 134275164577 in words is "one hundred thirty-four billion, two hundred seventy-five million, one hundred sixty-four thousand, five hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •