Base | Representation |
---|---|
bin | 111111100100000111… |
… | …0001111110100110111 |
3 | 111001100010210012211201 |
4 | 1333020032033310313 |
5 | 4214024302223330 |
6 | 142413024313331 |
7 | 12601450515535 |
oct | 1771016176467 |
9 | 431303705751 |
10 | 136503164215 |
11 | 52988528710 |
12 | 22556772847 |
13 | cb452929b2 |
14 | 686d055155 |
15 | 383dc3beca |
hex | 1fc838fd37 |
136503164215 has 64 divisors (see below), whose sum is σ = 190889975808. Its totient is φ = 92606976000.
The previous prime is 136503164179. The next prime is 136503164219. The reversal of 136503164215 is 512461305631.
It is a de Polignac number, because none of the positive numbers 2k-136503164215 is a prime.
It is a super-2 number, since 2×1365031642152 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136503164219) by changing a digit.
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 63 ways as a sum of consecutive naturals, for example, 87110362 + ... + 87111928.
It is an arithmetic number, because the mean of its divisors is an integer number (2982655872).
Almost surely, 2136503164215 is an apocalyptic number.
136503164215 is a deficient number, since it is larger than the sum of its proper divisors (54386811593).
136503164215 is a wasteful number, since it uses less digits than its factorization.
136503164215 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2368.
The product of its (nonzero) digits is 64800, while the sum is 37.
Adding to 136503164215 its reverse (512461305631), we get a palindrome (648964469846).
The spelling of 136503164215 in words is "one hundred thirty-six billion, five hundred three million, one hundred sixty-four thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •