Base | Representation |
---|---|
bin | 10000000110000… |
… | …01011011010000 |
3 | 100102001012220101 |
4 | 20003001123100 |
5 | 234030310000 |
6 | 21221422144 |
7 | 3226365106 |
oct | 1003013320 |
9 | 312035811 |
10 | 135010000 |
11 | 6a234014 |
12 | 3926a954 |
13 | 21c80c98 |
14 | 13d05c76 |
15 | bcbce6a |
hex | 80c16d0 |
135010000 has 100 divisors (see below), whose sum is σ = 341665632. Its totient is φ = 51568000.
The previous prime is 135009997. The next prime is 135010013. The reversal of 135010000 is 10531.
It is a tau number, because it is divible by the number of its divisors (100).
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 229707 + ... + 230293.
Almost surely, 2135010000 is an apocalyptic number.
135010000 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 135010000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (170832816).
135010000 is an abundant number, since it is smaller than the sum of its proper divisors (206655632).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
135010000 is an equidigital number, since it uses as much as digits as its factorization.
135010000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 638 (or 617 counting only the distinct ones).
The product of its (nonzero) digits is 15, while the sum is 10.
The square root of 135010000 is about 11619.3803621364. The cubic root of 135010000 is about 513.0054501788.
Adding to 135010000 its reverse (10531), we get a palindrome (135020531).
The spelling of 135010000 in words is "one hundred thirty-five million, ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •