Base | Representation |
---|---|
bin | 111111100001011111… |
… | …0100011001010001101 |
3 | 111001010000012021220020 |
4 | 1333002332203022031 |
5 | 4213334240204041 |
6 | 142400202212353 |
7 | 12566331516354 |
oct | 1770276431215 |
9 | 431100167806 |
10 | 136415163021 |
11 | 52942892055 |
12 | 225311b40b9 |
13 | cb2cc90797 |
14 | 68614a899b |
15 | 3836157866 |
hex | 1fc2fa328d |
136415163021 has 4 divisors (see below), whose sum is σ = 181886884032. Its totient is φ = 90943442012.
The previous prime is 136415163011. The next prime is 136415163067. The reversal of 136415163021 is 120361514631.
It is a happy number.
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, and also an emirpimes, since its reverse is a distinct semiprime: 120361514631 = 3 ⋅40120504877.
It is a cyclic number.
It is not a de Polignac number, because 136415163021 - 26 = 136415162957 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136415163011) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 22735860501 + ... + 22735860506.
It is an arithmetic number, because the mean of its divisors is an integer number (45471721008).
Almost surely, 2136415163021 is an apocalyptic number.
It is an amenable number.
136415163021 is a deficient number, since it is larger than the sum of its proper divisors (45471721011).
136415163021 is an equidigital number, since it uses as much as digits as its factorization.
136415163021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45471721010.
The product of its (nonzero) digits is 12960, while the sum is 33.
Adding to 136415163021 its reverse (120361514631), we get a palindrome (256776677652).
The spelling of 136415163021 in words is "one hundred thirty-six billion, four hundred fifteen million, one hundred sixty-three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.031 sec. • engine limits •