Base | Representation |
---|---|
bin | 11111000000111100010100… |
… | …000000100000010001111110 |
3 | 122212222010002100222110110020 |
4 | 133000330110000200101332 |
5 | 120334321301204431311 |
6 | 1202035120401153010 |
7 | 40505610166611615 |
oct | 3700742400402176 |
9 | 585863070873406 |
10 | 136404202030206 |
11 | 3a50a773aa5510 |
12 | 1337006b32b766 |
13 | 5b15b26990106 |
14 | 2597dda25487c |
15 | 10b82bdcaac06 |
hex | 7c0f1402047e |
136404202030206 has 32 divisors (see below), whose sum is σ = 298104358116096. Its totient is φ = 41265830280000.
The previous prime is 136404202030147. The next prime is 136404202030219. The reversal of 136404202030206 is 602030202404631.
It is a super-2 number, since 2×1364042020302062 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1719369930 + ... + 1719449261.
It is an arithmetic number, because the mean of its divisors is an integer number (9315761191128).
Almost surely, 2136404202030206 is an apocalyptic number.
136404202030206 is an abundant number, since it is smaller than the sum of its proper divisors (161700156085890).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136404202030206 is a wasteful number, since it uses less digits than its factorization.
136404202030206 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3438819808.
The product of its (nonzero) digits is 41472, while the sum is 33.
Adding to 136404202030206 its reverse (602030202404631), we get a palindrome (738434404434837).
The spelling of 136404202030206 in words is "one hundred thirty-six trillion, four hundred four billion, two hundred two million, thirty thousand, two hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •