Base | Representation |
---|---|
bin | 111111011000001111… |
… | …1110101101101000011 |
3 | 111000022101210121102200 |
4 | 1332300133311231003 |
5 | 4212220402411002 |
6 | 142305325044243 |
7 | 12555545311455 |
oct | 1766037655503 |
9 | 430271717380 |
10 | 136105122627 |
11 | 527a3880121 |
12 | 224653b6683 |
13 | cab0988926 |
14 | 68322402d5 |
15 | 3818d13b1c |
hex | 1fb07f5b43 |
136105122627 has 24 divisors (see below), whose sum is σ = 197368231008. Its totient is φ = 90380707200.
The previous prime is 136105122619. The next prime is 136105122661. The reversal of 136105122627 is 726221501631.
136105122627 is a `hidden beast` number, since 1 + 3 + 6 + 1 + 0 + 5 + 1 + 22 + 627 = 666.
It is not a de Polignac number, because 136105122627 - 23 = 136105122619 is a prime.
It is a super-2 number, since 2×1361051226272 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 136105122591 and 136105122600.
It is not an unprimeable number, because it can be changed into a prime (136105122227) 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 23 ways as a sum of consecutive naturals, for example, 8264133 + ... + 8280585.
It is an arithmetic number, because the mean of its divisors is an integer number (8223676292).
Almost surely, 2136105122627 is an apocalyptic number.
136105122627 is a deficient number, since it is larger than the sum of its proper divisors (61263108381).
136105122627 is a wasteful number, since it uses less digits than its factorization.
136105122627 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20011 (or 20008 counting only the distinct ones).
The product of its (nonzero) digits is 30240, while the sum is 36.
The spelling of 136105122627 in words is "one hundred thirty-six billion, one hundred five million, one hundred twenty-two thousand, six hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •