Base | Representation |
---|---|
bin | 10000010100111… |
… | …10100111111000 |
3 | 100112201112002222 |
4 | 20022132213320 |
5 | 240030331400 |
6 | 21331343212 |
7 | 3252115463 |
oct | 1012364770 |
9 | 315645088 |
10 | 136964600 |
11 | 70349593 |
12 | 39a51b08 |
13 | 224b6856 |
14 | 142942da |
15 | c057185 |
hex | 829e9f8 |
136964600 has 48 divisors (see below), whose sum is σ = 326229120. Its totient is φ = 53446400.
The previous prime is 136964579. The next prime is 136964657. The reversal of 136964600 is 6469631.
136964600 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 152 + ... + 16551.
It is an arithmetic number, because the mean of its divisors is an integer number (6796440).
Almost surely, 2136964600 is an apocalyptic number.
136964600 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 136964600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (163114560).
136964600 is an abundant number, since it is smaller than the sum of its proper divisors (189264520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136964600 is a wasteful number, since it uses less digits than its factorization.
136964600 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16760 (or 16751 counting only the distinct ones).
The product of its (nonzero) digits is 23328, while the sum is 35.
The square root of 136964600 is about 11703.1875999661. The cubic root of 136964600 is about 515.4692678150.
The spelling of 136964600 in words is "one hundred thirty-six million, nine hundred sixty-four thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •