Base | Representation |
---|---|
bin | 10000001100110… |
… | …11111100010000 |
3 | 100110201200200000 |
4 | 20012123330100 |
5 | 234242430130 |
6 | 21252530000 |
7 | 3240113415 |
oct | 1006337420 |
9 | 313650600 |
10 | 135905040 |
11 | 6a795517 |
12 | 39620900 |
13 | 222054ab |
14 | 1409a10c |
15 | bde8260 |
hex | 819bf10 |
135905040 has 120 divisors (see below), whose sum is σ = 473386368. Its totient is φ = 36236160.
The previous prime is 135905039. The next prime is 135905083. The reversal of 135905040 is 40509531.
It is a tau number, because it is divible by the number of its divisors (120).
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 135904995 and 135905013.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 15945 + ... + 22935.
Almost surely, 2135905040 is an apocalyptic number.
135905040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 135905040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (236693184).
135905040 is an abundant number, since it is smaller than the sum of its proper divisors (337481328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
135905040 is an equidigital number, since it uses as much as digits as its factorization.
135905040 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7019 (or 7001 counting only the distinct ones).
The product of its (nonzero) digits is 2700, while the sum is 27.
The square root of 135905040 is about 11657.8317023364. The cubic root of 135905040 is about 514.1365996262.
The spelling of 135905040 in words is "one hundred thirty-five million, nine hundred five thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •