Base | Representation |
---|---|
bin | 11110111110001100101000… |
… | …010011101011001110000000 |
3 | 122212022002011212022121221211 |
4 | 132332030220103223032000 |
5 | 120323223433343222130 |
6 | 1201412322150255504 |
7 | 40456151442262033 |
oct | 3676145023531600 |
9 | 585262155277854 |
10 | 136215564039040 |
11 | 3a447772849762 |
12 | 1333b5a4957594 |
13 | 5b010c35977b5 |
14 | 258cc2315901a |
15 | 10b342d082a2a |
hex | 7be3284eb380 |
136215564039040 has 32 divisors (see below), whose sum is σ = 325640332782360. Its totient is φ = 54486225615360.
The previous prime is 136215564039029. The next prime is 136215564039043. The reversal of 136215564039040 is 40930465512631.
It is a tau number, because it is divible by the number of its divisors (32).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136215564039043) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 106418408766 + ... + 106418410045.
Almost surely, 2136215564039040 is an apocalyptic number.
136215564039040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
136215564039040 is an abundant number, since it is smaller than the sum of its proper divisors (189424768743320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136215564039040 is an equidigital number, since it uses as much as digits as its factorization.
136215564039040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 212836818830 (or 212836818818 counting only the distinct ones).
The product of its (nonzero) digits is 2332800, while the sum is 49.
The spelling of 136215564039040 in words is "one hundred thirty-six trillion, two hundred fifteen billion, five hundred sixty-four million, thirty-nine thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •