Base | Representation |
---|---|
bin | 11110111011011110010110… |
… | …001000110111111100000001 |
3 | 122211122012011001002222212211 |
4 | 132323132112020313330001 |
5 | 120312142210100442124 |
6 | 1201150332554422121 |
7 | 40436505154343266 |
oct | 3673362610677401 |
9 | 584565131088784 |
10 | 136028428140289 |
11 | 3a3853724821a3 |
12 | 1330b279431941 |
13 | 5ab956c447969 |
14 | 2583b4d74926d |
15 | 10ad629168e94 |
hex | 7bb796237f01 |
136028428140289 has 2 divisors, whose sum is σ = 136028428140290. Its totient is φ = 136028428140288.
The previous prime is 136028428140221. The next prime is 136028428140347. The reversal of 136028428140289 is 982041824820631.
It is an a-pointer prime, because the next prime (136028428140347) can be obtained adding 136028428140289 to its sum of digits (58).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 88033558064400 + 47994870075889 = 9382620^2 + 6927833^2 .
It is a cyclic number.
It is not a de Polignac number, because 136028428140289 - 29 = 136028428139777 is a prime.
It is not a weakly prime, because it can be changed into another prime (136028426140289) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 68014214070144 + 68014214070145.
It is an arithmetic number, because the mean of its divisors is an integer number (68014214070145).
Almost surely, 2136028428140289 is an apocalyptic number.
It is an amenable number.
136028428140289 is a deficient number, since it is larger than the sum of its proper divisors (1).
136028428140289 is an equidigital number, since it uses as much as digits as its factorization.
136028428140289 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10616832, while the sum is 58.
The spelling of 136028428140289 in words is "one hundred thirty-six trillion, twenty-eight billion, four hundred twenty-eight million, one hundred forty thousand, two hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •