Base | Representation |
---|---|
bin | 111111011011001110… |
… | …1101001111000010000 |
3 | 111000120101010201212221 |
4 | 1332312131221320100 |
5 | 4212422013310300 |
6 | 142323302230424 |
7 | 12561202131640 |
oct | 1766635517020 |
9 | 430511121787 |
10 | 136205213200 |
11 | 52845323701 |
12 | 22492a25414 |
13 | cac8631714 |
14 | 6841656520 |
15 | 38229d531a |
hex | 1fb6769e10 |
136205213200 has 120 divisors (see below), whose sum is σ = 374106875072. Its totient is φ = 46683164160.
The previous prime is 136205213159. The next prime is 136205213203. The reversal of 136205213200 is 2312502631.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is not an unprimeable number, because it can be changed into a prime (136205213203) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 10849327 + ... + 10861873.
Almost surely, 2136205213200 is an apocalyptic number.
136205213200 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 136205213200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (187053437536).
136205213200 is an abundant number, since it is smaller than the sum of its proper divisors (237901661872).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136205213200 is a wasteful number, since it uses less digits than its factorization.
136205213200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16449 (or 16438 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 25.
Adding to 136205213200 its reverse (2312502631), we get a palindrome (138517715831).
The spelling of 136205213200 in words is "one hundred thirty-six billion, two hundred five million, two hundred thirteen thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •