Base | Representation |
---|---|
bin | 111111011100110100… |
… | …0011111010101100101 |
3 | 111000201002012011020020 |
4 | 1332321220133111211 |
5 | 4213024121312003 |
6 | 142332442025353 |
7 | 12562416110334 |
oct | 1767150372545 |
9 | 430632164206 |
10 | 136258385253 |
11 | 52872340651 |
12 | 224a87a8259 |
13 | cb0665a883 |
14 | 6848737d1b |
15 | 38274d9d53 |
hex | 1fb9a1f565 |
136258385253 has 4 divisors (see below), whose sum is σ = 181677847008. Its totient is φ = 90838923500.
The previous prime is 136258385239. The next prime is 136258385269. The reversal of 136258385253 is 352583852631.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 136258385253 - 26 = 136258385189 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 136258385196 and 136258385205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136258385293) 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 3 ways as a sum of consecutive naturals, for example, 22709730873 + ... + 22709730878.
It is an arithmetic number, because the mean of its divisors is an integer number (45419461752).
Almost surely, 2136258385253 is an apocalyptic number.
It is an amenable number.
136258385253 is a deficient number, since it is larger than the sum of its proper divisors (45419461755).
136258385253 is an equidigital number, since it uses as much as digits as its factorization.
136258385253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45419461754.
The product of its digits is 5184000, while the sum is 51.
The spelling of 136258385253 in words is "one hundred thirty-six billion, two hundred fifty-eight million, three hundred eighty-five thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •