Base | Representation |
---|---|
bin | 111111110000101011… |
… | …0101000000100011011 |
3 | 111002102112011002011001 |
4 | 1333201112220010123 |
5 | 4220410221303232 |
6 | 142522525245431 |
7 | 12615060343411 |
oct | 1774126500433 |
9 | 432375132131 |
10 | 136924791067 |
11 | 53084525159 |
12 | 22653a03877 |
13 | cbb173703c |
14 | 68ad0492b1 |
15 | 3865c736e7 |
hex | 1fe15a811b |
136924791067 has 2 divisors, whose sum is σ = 136924791068. Its totient is φ = 136924791066.
The previous prime is 136924791023. The next prime is 136924791071. The reversal of 136924791067 is 760197429631.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-136924791067 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 136924790999 and 136924791017.
It is not a weakly prime, because it can be changed into another prime (136924791077) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 68462395533 + 68462395534.
It is an arithmetic number, because the mean of its divisors is an integer number (68462395534).
Almost surely, 2136924791067 is an apocalyptic number.
136924791067 is a deficient number, since it is larger than the sum of its proper divisors (1).
136924791067 is an equidigital number, since it uses as much as digits as its factorization.
136924791067 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3429216, while the sum is 55.
The spelling of 136924791067 in words is "one hundred thirty-six billion, nine hundred twenty-four million, seven hundred ninety-one thousand, sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •