Base | Representation |
---|---|
bin | 10000010101000… |
… | …11000100010000 |
3 | 100112202110002001 |
4 | 20022203010100 |
5 | 240031422200 |
6 | 21332003344 |
7 | 3252222523 |
oct | 1012430420 |
9 | 315673061 |
10 | 136982800 |
11 | 70361229 |
12 | 39a60554 |
13 | 224c1c16 |
14 | 1429abba |
15 | c05c76a |
hex | 82a3110 |
136982800 has 60 divisors (see below), whose sum is σ = 339748096. Its totient is φ = 53020800.
The previous prime is 136982789. The next prime is 136982801. The reversal of 136982800 is 8289631.
136982800 is nontrivially palindromic in base 7.
It is a self number, because there is not a number n which added to its sum of digits gives 136982800.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136982801) 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, 6877 + ... + 17923.
Almost surely, 2136982800 is an apocalyptic number.
136982800 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 136982800, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (169874048).
136982800 is an abundant number, since it is smaller than the sum of its proper divisors (202765296).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136982800 is a wasteful number, since it uses less digits than its factorization.
136982800 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11096 (or 11085 counting only the distinct ones).
The product of its (nonzero) digits is 20736, while the sum is 37.
The square root of 136982800 is about 11703.9651400711. The cubic root of 136982800 is about 515.4920988364.
The spelling of 136982800 in words is "one hundred thirty-six million, nine hundred eighty-two thousand, eight hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •