Base | Representation |
---|---|
bin | 111110111001011100… |
… | …1011110110001011111 |
3 | 110220122101011010012000 |
4 | 1331302321132301133 |
5 | 4203111321011210 |
6 | 142015010213343 |
7 | 12521126066346 |
oct | 1756271366137 |
9 | 426571133160 |
10 | 135071657055 |
11 | 5231347a145 |
12 | 22217284253 |
13 | c97783223a |
14 | 6774ca0b5d |
15 | 37a8221ac0 |
hex | 1f72e5ec5f |
135071657055 has 32 divisors (see below), whose sum is σ = 243509483520. Its totient is φ = 71023589280.
The previous prime is 135071657003. The next prime is 135071657057. The reversal of 135071657055 is 550756170531.
135071657055 is a `hidden beast` number, since 1 + 3 + 5 + 0 + 71 + 6 + 570 + 5 + 5 = 666.
It is not a de Polignac number, because 135071657055 - 213 = 135071648863 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a self number, because there is not a number n which added to its sum of digits gives 135071657055.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (135071657057) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 7036407 + ... + 7055576.
It is an arithmetic number, because the mean of its divisors is an integer number (7609671360).
Almost surely, 2135071657055 is an apocalyptic number.
135071657055 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
135071657055 is a deficient number, since it is larger than the sum of its proper divisors (108437826465).
135071657055 is a wasteful number, since it uses less digits than its factorization.
135071657055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14092068 (or 14092062 counting only the distinct ones).
The product of its (nonzero) digits is 551250, while the sum is 45.
The spelling of 135071657055 in words is "one hundred thirty-five billion, seventy-one million, six hundred fifty-seven thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •