Base | Representation |
---|---|
bin | 10000001011010… |
… | …01111000100000 |
3 | 100110100021101221 |
4 | 20011221320200 |
5 | 234214400000 |
6 | 21244304424 |
7 | 3235300552 |
oct | 1005517040 |
9 | 313307357 |
10 | 135700000 |
11 | 6a665467 |
12 | 39542114 |
13 | 22163077 |
14 | 140454d2 |
15 | bda761a |
hex | 8169e20 |
135700000 has 144 divisors (see below), whose sum is σ = 354352320. Its totient is φ = 51040000.
The previous prime is 135699983. The next prime is 135700013. The reversal of 135700000 is 7531.
It is a Harshad number since it is a multiple of its sum of digits (16).
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, 2299971 + ... + 2300029.
It is an arithmetic number, because the mean of its divisors is an integer number (2460780).
Almost surely, 2135700000 is an apocalyptic number.
135700000 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 135700000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (177176160).
135700000 is an abundant number, since it is smaller than the sum of its proper divisors (218652320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
135700000 is an frugal number, since it uses more digits than its factorization.
135700000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 117 (or 89 counting only the distinct ones).
The product of its (nonzero) digits is 105, while the sum is 16.
The square root of 135700000 is about 11649.0342947388. The cubic root of 135700000 is about 513.8779101082.
Adding to 135700000 its reverse (7531), we get a palindrome (135707531).
The spelling of 135700000 in words is "one hundred thirty-five million, seven hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •