Base | Representation |
---|---|
bin | 111110111000100110… |
… | …0111100011110110000 |
3 | 110220120101121121100200 |
4 | 1331301030330132300 |
5 | 4203032030030130 |
6 | 142012112315200 |
7 | 12520332206022 |
oct | 1756114743660 |
9 | 426511547320 |
10 | 135043205040 |
11 | 522a9406787 |
12 | 22209842b00 |
13 | c97197ca23 |
14 | 67711b6012 |
15 | 37a59a1760 |
hex | 1f7133c7b0 |
135043205040 has 60 divisors (see below), whose sum is σ = 453520099344. Its totient is φ = 36011521152.
The previous prime is 135043205029. The next prime is 135043205041. The reversal of 135043205040 is 40502340531.
135043205040 is a `hidden beast` number, since 135 + 0 + 4 + 3 + 20 + 504 + 0 = 666.
It is a tau number, because it is divible by the number of its divisors (60).
It is a junction number, because it is equal to n+sod(n) for n = 135043204995 and 135043205013.
It is not an unprimeable number, because it can be changed into a prime (135043205041) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 93779284 + ... + 93780723.
Almost surely, 2135043205040 is an apocalyptic number.
135043205040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
135043205040 is an abundant number, since it is smaller than the sum of its proper divisors (318476894304).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
135043205040 is a wasteful number, since it uses less digits than its factorization.
135043205040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 187560026 (or 187560017 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 27.
Adding to 135043205040 its reverse (40502340531), we get a palindrome (175545545571).
The spelling of 135043205040 in words is "one hundred thirty-five billion, forty-three million, two hundred five thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •