Base | Representation |
---|---|
bin | 11110111100100101001000… |
… | …001111011111001111010111 |
3 | 122211220110022210021011102010 |
4 | 132330211020033133033113 |
5 | 120314413333222200430 |
6 | 1201245302352315303 |
7 | 40445135446205112 |
oct | 3674451017371727 |
9 | 584813283234363 |
10 | 136104430662615 |
11 | 3a404623968118 |
12 | 13321b4a542b33 |
13 | 5ac379233216c |
14 | 25876bd629579 |
15 | 10b05c670ecb0 |
hex | 7bc9483df3d7 |
136104430662615 has 32 divisors (see below), whose sum is σ = 217972860019200. Its totient is φ = 72520459928960.
The previous prime is 136104430662611. The next prime is 136104430662623. The reversal of 136104430662615 is 516266034401631.
It is a happy number.
It is not a de Polignac number, because 136104430662615 - 22 = 136104430662611 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136104430662611) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 105823876 + ... + 107102294.
It is an arithmetic number, because the mean of its divisors is an integer number (6811651875600).
Almost surely, 2136104430662615 is an apocalyptic number.
136104430662615 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
136104430662615 is a deficient number, since it is larger than the sum of its proper divisors (81868429356585).
136104430662615 is a wasteful number, since it uses less digits than its factorization.
136104430662615 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1285127.
The product of its (nonzero) digits is 1866240, while the sum is 48.
The spelling of 136104430662615 in words is "one hundred thirty-six trillion, one hundred four billion, four hundred thirty million, six hundred sixty-two thousand, six hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •