Base | Representation |
---|---|
bin | 111111001000101011… |
… | …1001010011100101101 |
3 | 110221221222212120012220 |
4 | 1332101113022130231 |
5 | 4210133141121410 |
6 | 142141424545553 |
7 | 12536603253564 |
oct | 1762127123455 |
9 | 427858776186 |
10 | 135582754605 |
11 | 52555a26311 |
12 | 2233a4822b9 |
13 | ca296a161c |
14 | 67c2b04bdb |
15 | 37d802d070 |
hex | 1f915ca72d |
135582754605 has 8 divisors (see below), whose sum is σ = 216932407392. Its totient is φ = 72310802448.
The previous prime is 135582754583. The next prime is 135582754609. The reversal of 135582754605 is 506457285531.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 135582754605 - 27 = 135582754477 is a prime.
It is a Smith number, since the sum of its digits (51) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (135582754609) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4519425139 + ... + 4519425168.
It is an arithmetic number, because the mean of its divisors is an integer number (27116550924).
Almost surely, 2135582754605 is an apocalyptic number.
135582754605 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
135582754605 is a deficient number, since it is larger than the sum of its proper divisors (81349652787).
135582754605 is an equidigital number, since it uses as much as digits as its factorization.
135582754605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9038850315.
The product of its (nonzero) digits is 5040000, while the sum is 51.
The spelling of 135582754605 in words is "one hundred thirty-five billion, five hundred eighty-two million, seven hundred fifty-four thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •