Base | Representation |
---|---|
bin | 111111000110010001… |
… | …1101001001010001101 |
3 | 110221202101011220211110 |
4 | 1332030203221022031 |
5 | 4210002021440140 |
6 | 142125425042233 |
7 | 12534604120656 |
oct | 1761443511215 |
9 | 427671156743 |
10 | 135502140045 |
11 | 52514475408 |
12 | 22317486379 |
13 | ca15a875bc |
14 | 67b611c52d |
15 | 37d0e07380 |
hex | 1f8c8e928d |
135502140045 has 32 divisors (see below), whose sum is σ = 223087463424. Its totient is φ = 70188940800.
The previous prime is 135502140031. The next prime is 135502140049. The reversal of 135502140045 is 540041205531.
It is not a de Polignac number, because 135502140045 - 25 = 135502140013 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 135502139994 and 135502140021.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (135502140049) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 356866 + ... + 631155.
It is an arithmetic number, because the mean of its divisors is an integer number (6971483232).
Almost surely, 2135502140045 is an apocalyptic number.
135502140045 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
135502140045 is a deficient number, since it is larger than the sum of its proper divisors (87585323379).
135502140045 is a wasteful number, since it uses less digits than its factorization.
135502140045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 988293.
The product of its (nonzero) digits is 12000, while the sum is 30.
Adding to 135502140045 its reverse (540041205531), we get a palindrome (675543345576).
The spelling of 135502140045 in words is "one hundred thirty-five billion, five hundred two million, one hundred forty thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •