Base | Representation |
---|---|
bin | 111111100100101011… |
… | …0000100100101110101 |
3 | 111001101110012210111000 |
4 | 1333021112010211311 |
5 | 4214044112230230 |
6 | 142414540033513 |
7 | 12602066534640 |
oct | 1771126044565 |
9 | 431343183430 |
10 | 136521992565 |
11 | 52998118732 |
12 | 22560b32899 |
13 | cb49155a2a |
14 | 6871756a57 |
15 | 384070ab60 |
hex | 1fc9584975 |
136521992565 has 128 divisors (see below), whose sum is σ = 295940874240. Its totient is φ = 58289587200.
The previous prime is 136521992549. The next prime is 136521992573. The reversal of 136521992565 is 565299125631.
136521992565 is a `hidden beast` number, since 1 + 3 + 6 + 521 + 99 + 25 + 6 + 5 = 666.
It is not a de Polignac number, because 136521992565 - 24 = 136521992549 is a prime.
It is a hoax number, since the sum of its digits (54) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 2072080 + ... + 2136950.
It is an arithmetic number, because the mean of its divisors is an integer number (2312038080).
Almost surely, 2136521992565 is an apocalyptic number.
136521992565 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
136521992565 is an abundant number, since it is smaller than the sum of its proper divisors (159418881675).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136521992565 is a wasteful number, since it uses less digits than its factorization.
136521992565 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 65040 (or 65034 counting only the distinct ones).
The product of its digits is 4374000, while the sum is 54.
The spelling of 136521992565 in words is "one hundred thirty-six billion, five hundred twenty-one million, nine hundred ninety-two thousand, five hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •