Base | Representation |
---|---|
bin | 111111101100110000… |
… | …1101001000000000000 |
3 | 111002002101000210210201 |
4 | 1333121201221000000 |
5 | 4220123111220421 |
6 | 142501514334544 |
7 | 12611604142222 |
oct | 1773141510000 |
9 | 432071023721 |
10 | 136793460736 |
11 | 53017384799 |
12 | 22617a2a454 |
13 | cb90473b9a |
14 | 6899820412 |
15 | 3859480b91 |
hex | 1fd9869000 |
136793460736 has 39 divisors (see below), whose sum is σ = 273600868611. Its totient is φ = 68384894976.
The previous prime is 136793460719. The next prime is 136793460767. The reversal of 136793460736 is 637064397631.
It is a happy number.
The square root of 136793460736 is 369856.
It is a perfect power (a square), and thus also a powerful number.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 23667895 + ... + 23673673.
Almost surely, 2136793460736 is an apocalyptic number.
136793460736 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
136793460736 is the 369856-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 136793460736
136793460736 is an abundant number, since it is smaller than the sum of its proper divisors (136807407875).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136793460736 is an frugal number, since it uses more digits than its factorization.
136793460736 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11582 (or 5781 counting only the distinct ones).
The product of its (nonzero) digits is 10287648, while the sum is 55.
It can be divided in two parts, 136793 and 460736, that added together give a square (597529 = 7732).
The spelling of 136793460736 in words is "one hundred thirty-six billion, seven hundred ninety-three million, four hundred sixty thousand, seven hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •