Base | Representation |
---|---|
bin | 11110111100101100101011… |
… | …010011100100000011010000 |
3 | 122211221020020121020120102222 |
4 | 132330230223103210003100 |
5 | 120320031432443014344 |
6 | 1201253122503200212 |
7 | 40445543336050646 |
oct | 3674545323440320 |
9 | 584836217216388 |
10 | 136112535126224 |
11 | 3a4080026a5628 |
12 | 13323630746068 |
13 | 5ac44843bc667 |
14 | 2587c4bb27196 |
15 | 10b08ece925ee |
hex | 7bcb2b4e40d0 |
136112535126224 has 10 divisors (see below), whose sum is σ = 263718036807090. Its totient is φ = 68056267563104.
The previous prime is 136112535126157. The next prime is 136112535126233. The reversal of 136112535126224 is 422621535211631.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 136105822273600 + 6712852624 = 11666440^2 + 81932^2 .
It is a super-2 number, since 2×1361125351262242 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 as a sum of consecutive naturals, namely, 4253516722679 + ... + 4253516722710.
It is an arithmetic number, because the mean of its divisors is an integer number (26371803680709).
Almost surely, 2136112535126224 is an apocalyptic number.
It is an amenable number.
136112535126224 is a deficient number, since it is larger than the sum of its proper divisors (127605501680866).
136112535126224 is an equidigital number, since it uses as much as digits as its factorization.
136112535126224 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8507033445397 (or 8507033445391 counting only the distinct ones).
The product of its digits is 518400, while the sum is 44.
The spelling of 136112535126224 in words is "one hundred thirty-six trillion, one hundred twelve billion, five hundred thirty-five million, one hundred twenty-six thousand, two hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •