Base | Representation |
---|---|
bin | 11111000010110110001000… |
… | …011111001010011110000010 |
3 | 122220102121201021022011020220 |
4 | 133002312020133022132002 |
5 | 120343442142320241031 |
6 | 1202215152052043510 |
7 | 40521220465564200 |
oct | 3702661037123602 |
9 | 586377637264226 |
10 | 136535005243266 |
11 | 3a560196aaa493 |
12 | 13391495003596 |
13 | 5b252710a1136 |
14 | 25a0488284070 |
15 | 10bb8c73cd596 |
hex | 7c2d887ca782 |
136535005243266 has 48 divisors (see below), whose sum is σ = 318117954537504. Its totient is φ = 38952885772416.
The previous prime is 136535005243201. The next prime is 136535005243289. The reversal of 136535005243266 is 662342500535631.
It is a super-2 number, since 2×1365350052432662 (a number of 29 digits) contains 22 as substring.
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 in 23 ways as a sum of consecutive naturals, for example, 339773415 + ... + 340175018.
It is an arithmetic number, because the mean of its divisors is an integer number (6627457386198).
Almost surely, 2136535005243266 is an apocalyptic number.
136535005243266 is an abundant number, since it is smaller than the sum of its proper divisors (181582949294238).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136535005243266 is a wasteful number, since it uses less digits than its factorization.
136535005243266 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 679949135 (or 679949128 counting only the distinct ones).
The product of its (nonzero) digits is 11664000, while the sum is 51.
Adding to 136535005243266 its reverse (662342500535631), we get a palindrome (798877505778897).
The spelling of 136535005243266 in words is "one hundred thirty-six trillion, five hundred thirty-five billion, five million, two hundred forty-three thousand, two hundred sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •