Base | Representation |
---|---|
bin | 111110110111110010… |
… | …1010110110110010001 |
3 | 110220111111111222201212 |
4 | 1331233211112312101 |
5 | 4203003102100230 |
6 | 142005302305505 |
7 | 12516552330011 |
oct | 1755745266621 |
9 | 426444458655 |
10 | 135016050065 |
11 | 52295049856 |
12 | 22200728295 |
13 | c9691629b0 |
14 | 676b747c41 |
15 | 37a33da895 |
hex | 1f6f956d91 |
135016050065 has 16 divisors (see below), whose sum is σ = 174557073600. Its totient is φ = 99661420992.
The previous prime is 135016050019. The next prime is 135016050067. The reversal of 135016050065 is 560050610531.
It is a cyclic number.
It is not a de Polignac number, because 135016050065 - 220 = 135015001489 is a prime.
It is not an unprimeable number, because it can be changed into a prime (135016050067) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 291995 + ... + 596064.
It is an arithmetic number, because the mean of its divisors is an integer number (10909817100).
Almost surely, 2135016050065 is an apocalyptic number.
It is an amenable number.
135016050065 is a deficient number, since it is larger than the sum of its proper divisors (39541023535).
135016050065 is a wasteful number, since it uses less digits than its factorization.
135016050065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 890416.
The product of its (nonzero) digits is 13500, while the sum is 32.
Adding to 135016050065 its reverse (560050610531), we get a palindrome (695066660596).
The spelling of 135016050065 in words is "one hundred thirty-five billion, sixteen million, fifty thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •