Base | Representation |
---|---|
bin | 111111101000011000… |
… | …0000110000100000101 |
3 | 111001201010000222021222 |
4 | 1333100300012010011 |
5 | 4214322420123403 |
6 | 142435135250125 |
7 | 12605136000443 |
oct | 1772060060405 |
9 | 431633028258 |
10 | 136646254853 |
11 | 52a51280839 |
12 | 22596679945 |
13 | cb68b12a04 |
14 | 6884061b93 |
15 | 384b5a4338 |
hex | 1fd0c06105 |
136646254853 has 2 divisors, whose sum is σ = 136646254854. Its totient is φ = 136646254852.
The previous prime is 136646254841. The next prime is 136646254859. The reversal of 136646254853 is 358452646631.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 83507706529 + 53138548324 = 288977^2 + 230518^2 .
It is a cyclic number.
It is not a de Polignac number, because 136646254853 - 210 = 136646253829 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 136646254795 and 136646254804.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (136646254859) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 68323127426 + 68323127427.
It is an arithmetic number, because the mean of its divisors is an integer number (68323127427).
Almost surely, 2136646254853 is an apocalyptic number.
It is an amenable number.
136646254853 is a deficient number, since it is larger than the sum of its proper divisors (1).
136646254853 is an equidigital number, since it uses as much as digits as its factorization.
136646254853 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 12441600, while the sum is 53.
The spelling of 136646254853 in words is "one hundred thirty-six billion, six hundred forty-six million, two hundred fifty-four thousand, eight hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •