Base | Representation |
---|---|
bin | 111110101100001001… |
… | …0000010100000110001 |
3 | 110212111020220011212121 |
4 | 1331120102002200301 |
5 | 4201203012010230 |
6 | 141502415154241 |
7 | 12504064361155 |
oct | 1753022024061 |
9 | 425436804777 |
10 | 134625110065 |
11 | 52104401846 |
12 | 22111815981 |
13 | c906174154 |
14 | 6731861065 |
15 | 377de1677a |
hex | 1f58482831 |
134625110065 has 16 divisors (see below), whose sum is σ = 168754094208. Its totient is φ = 102907449216.
The previous prime is 134625109967. The next prime is 134625110083. The reversal of 134625110065 is 560011526431.
It is a cyclic number.
It is not a de Polignac number, because 134625110065 - 213 = 134625101873 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 134625110065.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 516927 + ... + 732436.
It is an arithmetic number, because the mean of its divisors is an integer number (10547130888).
Almost surely, 2134625110065 is an apocalyptic number.
It is an amenable number.
134625110065 is a deficient number, since it is larger than the sum of its proper divisors (34128984143).
134625110065 is a wasteful number, since it uses less digits than its factorization.
134625110065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1250328.
The product of its (nonzero) digits is 21600, while the sum is 34.
Adding to 134625110065 its reverse (560011526431), we get a palindrome (694636636496).
The spelling of 134625110065 in words is "one hundred thirty-four billion, six hundred twenty-five million, one hundred ten thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •