Base | Representation |
---|---|
bin | 111110111010110000… |
… | …1001010110111101101 |
3 | 110220202102212110010220 |
4 | 1331311201022313231 |
5 | 4203204044200400 |
6 | 142023220321553 |
7 | 12522201532626 |
oct | 1756541126755 |
9 | 426672773126 |
10 | 135115615725 |
11 | 52336273a22 |
12 | 22229b432b9 |
13 | c98398389c |
14 | 677aa64a4d |
15 | 37ac0067a0 |
hex | 1f7584aded |
135115615725 has 12 divisors (see below), whose sum is σ = 223391151456. Its totient is φ = 72061661680.
The previous prime is 135115615697. The next prime is 135115615729. The reversal of 135115615725 is 527516511531.
It is not a de Polignac number, because 135115615725 - 25 = 135115615693 is a prime.
It is a super-2 number, since 2×1351156157252 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (135115615729) 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 11 ways as a sum of consecutive naturals, for example, 900770697 + ... + 900770846.
It is an arithmetic number, because the mean of its divisors is an integer number (18615929288).
Almost surely, 2135115615725 is an apocalyptic number.
135115615725 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
135115615725 is a deficient number, since it is larger than the sum of its proper divisors (88275535731).
135115615725 is a wasteful number, since it uses less digits than its factorization.
135115615725 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1801541556 (or 1801541551 counting only the distinct ones).
The product of its digits is 157500, while the sum is 42.
The spelling of 135115615725 in words is "one hundred thirty-five billion, one hundred fifteen million, six hundred fifteen thousand, seven hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •