Base | Representation |
---|---|
bin | 10000000101101… |
… | …01010110010111 |
3 | 100101221201001100 |
4 | 20002311112113 |
5 | 234022214120 |
6 | 21220401143 |
7 | 3226100643 |
oct | 1002652627 |
9 | 311851040 |
10 | 134960535 |
11 | 6a1aa936 |
12 | 392461b3 |
13 | 21c64608 |
14 | 13cd1c23 |
15 | bcad490 |
hex | 80b5597 |
134960535 has 24 divisors (see below), whose sum is σ = 247693680. Its totient is φ = 67744512.
The previous prime is 134960509. The next prime is 134960537. The reversal of 134960535 is 535069431.
134960535 is a `hidden beast` number, since 1 + 3 + 49 + 605 + 3 + 5 = 666.
It is not a de Polignac number, because 134960535 - 213 = 134952343 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 134960535.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (134960537) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 87445 + ... + 88974.
It is an arithmetic number, because the mean of its divisors is an integer number (10320570).
Almost surely, 2134960535 is an apocalyptic number.
134960535 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
134960535 is a deficient number, since it is larger than the sum of its proper divisors (112733145).
134960535 is a wasteful number, since it uses less digits than its factorization.
134960535 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 176447 (or 176444 counting only the distinct ones).
The product of its (nonzero) digits is 48600, while the sum is 36.
The square root of 134960535 is about 11617.2516112891. The cubic root of 134960535 is about 512.9427908343.
The spelling of 134960535 in words is "one hundred thirty-four million, nine hundred sixty thousand, five hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •