Base | Representation |
---|---|
bin | 11110111101110111001100… |
… | …001000110100110010010011 |
3 | 122212012212202110220021100122 |
4 | 132331313030020310302103 |
5 | 120322334311432314131 |
6 | 1201353553534340455 |
7 | 40454405113400240 |
oct | 3675671410646223 |
9 | 585185673807318 |
10 | 136192542854291 |
11 | 3a438a299aa940 |
12 | 1333703b05a72b |
13 | 5acbb94ccbba1 |
14 | 258ba7b9145c7 |
15 | 10b2a31e8ad7b |
hex | 7bddcc234c93 |
136192542854291 has 32 divisors (see below), whose sum is σ = 170478641737728. Its totient is φ = 105699061923840.
The previous prime is 136192542854281. The next prime is 136192542854309. The reversal of 136192542854291 is 192458245291631.
It is a happy number.
It is not a de Polignac number, because 136192542854291 - 234 = 136175362985107 is a prime.
It is a super-2 number, since 2×1361925428542912 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (136192542854281) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 175001651 + ... + 175778163.
It is an arithmetic number, because the mean of its divisors is an integer number (5327457554304).
Almost surely, 2136192542854291 is an apocalyptic number.
136192542854291 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
136192542854291 is a deficient number, since it is larger than the sum of its proper divisors (34286098883437).
136192542854291 is a wasteful number, since it uses less digits than its factorization.
136192542854291 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 785651.
The product of its digits is 37324800, while the sum is 62.
The spelling of 136192542854291 in words is "one hundred thirty-six trillion, one hundred ninety-two billion, five hundred forty-two million, eight hundred fifty-four thousand, two hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •