Base | Representation |
---|---|
bin | 11110101110001011101100… |
… | …100111111110100101011001 |
3 | 122201101212120020001212211120 |
4 | 132232023230213332211121 |
5 | 120202211111040204010 |
6 | 1155210555250515453 |
7 | 40313511631531620 |
oct | 3656135447764531 |
9 | 581355506055746 |
10 | 135115051100505 |
11 | 3a062a759a4423 |
12 | 131a2251295b89 |
13 | 5a513aa4571c8 |
14 | 25518638cc6b7 |
15 | 10949bc55ee70 |
hex | 7ae2ec9fe959 |
135115051100505 has 32 divisors (see below), whose sum is σ = 247071766508544. Its totient is φ = 61765819379136.
The previous prime is 135115051100461. The next prime is 135115051100599. The reversal of 135115051100505 is 505001150511531.
It is a happy number.
It is not a de Polignac number, because 135115051100505 - 210 = 135115051099481 is a prime.
It is a super-2 number, since 2×1351150511005052 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4896079 + ... + 17152308.
It is an arithmetic number, because the mean of its divisors is an integer number (7720992703392).
Almost surely, 2135115051100505 is an apocalyptic number.
135115051100505 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
135115051100505 is a deficient number, since it is larger than the sum of its proper divisors (111956715408039).
135115051100505 is a wasteful number, since it uses less digits than its factorization.
135115051100505 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22106765.
The product of its (nonzero) digits is 9375, while the sum is 33.
The spelling of 135115051100505 in words is "one hundred thirty-five trillion, one hundred fifteen billion, fifty-one million, one hundred thousand, five hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •