Base | Representation |
---|---|
bin | 111111100111010101… |
… | …0011011101010101001 |
3 | 111001121200002211002012 |
4 | 1333032222123222221 |
5 | 4214234432403131 |
6 | 142431444245305 |
7 | 12604232114456 |
oct | 1771652335251 |
9 | 431550084065 |
10 | 136611216041 |
11 | 52a33519643 |
12 | 225869a0835 |
13 | cb617953a1 |
14 | 687d54082d |
15 | 384848252b |
hex | 1fcea9baa9 |
136611216041 has 4 divisors (see below), whose sum is σ = 136626736512. Its totient is φ = 136595695572.
The previous prime is 136611216037. The next prime is 136611216061. The reversal of 136611216041 is 140612116631.
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 136611216041 - 22 = 136611216037 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 136611215989 and 136611216007.
It is not an unprimeable number, because it can be changed into a prime (136611216031) 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, 7747025 + ... + 7764638.
It is an arithmetic number, because the mean of its divisors is an integer number (34156684128).
Almost surely, 2136611216041 is an apocalyptic number.
It is an amenable number.
136611216041 is a deficient number, since it is larger than the sum of its proper divisors (15520471).
136611216041 is an equidigital number, since it uses as much as digits as its factorization.
136611216041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15520470.
The product of its (nonzero) digits is 5184, while the sum is 32.
The spelling of 136611216041 in words is "one hundred thirty-six billion, six hundred eleven million, two hundred sixteen thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •