Base | Representation |
---|---|
bin | 111110100100000000… |
… | …0011101001010110101 |
3 | 110211210020010001202000 |
4 | 1331020000131022311 |
5 | 4200123112041310 |
6 | 141415343005513 |
7 | 12464240466051 |
oct | 1751000351265 |
9 | 424706101660 |
10 | 134352065205 |
11 | 51a84269136 |
12 | 22056299899 |
13 | c891723447 |
14 | 67074a6c61 |
15 | 3764e7e4c0 |
hex | 1f4801d2b5 |
134352065205 has 32 divisors (see below), whose sum is σ = 238906953600. Its totient is φ = 71636783616.
The previous prime is 134352065191. The next prime is 134352065269. The reversal of 134352065205 is 502560253431.
134352065205 is a `hidden beast` number, since 1 + 343 + 52 + 0 + 65 + 205 = 666.
It is not a de Polignac number, because 134352065205 - 210 = 134352064181 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 134352065205.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 436902 + ... + 677928.
It is an arithmetic number, because the mean of its divisors is an integer number (7465842300).
Almost surely, 2134352065205 is an apocalyptic number.
134352065205 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
134352065205 is a deficient number, since it is larger than the sum of its proper divisors (104554888395).
134352065205 is a wasteful number, since it uses less digits than its factorization.
134352065205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 245170 (or 245164 counting only the distinct ones).
The product of its (nonzero) digits is 108000, while the sum is 36.
The spelling of 134352065205 in words is "one hundred thirty-four billion, three hundred fifty-two million, sixty-five thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •