Base | Representation |
---|---|
bin | 111110110110000101… |
… | …1100100011010001001 |
3 | 110220100112002102102222 |
4 | 1331230023210122021 |
5 | 4202343443130332 |
6 | 141555502503425 |
7 | 12515260134326 |
oct | 1755413443211 |
9 | 426315072388 |
10 | 134958958217 |
11 | 522658a4906 |
12 | 221a5594b75 |
13 | c95a393635 |
14 | 6763d25b4d |
15 | 379d3ae712 |
hex | 1f6c2e4689 |
134958958217 has 2 divisors, whose sum is σ = 134958958218. Its totient is φ = 134958958216.
The previous prime is 134958958201. The next prime is 134958958219. The reversal of 134958958217 is 712859859431.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 124849862281 + 10109095936 = 353341^2 + 100544^2 .
It is a cyclic number.
It is not a de Polignac number, because 134958958217 - 24 = 134958958201 is a prime.
Together with 134958958219, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 134958958217.
It is not a weakly prime, because it can be changed into another prime (134958958219) 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, 67479479108 + 67479479109.
It is an arithmetic number, because the mean of its divisors is an integer number (67479479109).
Almost surely, 2134958958217 is an apocalyptic number.
It is an amenable number.
134958958217 is a deficient number, since it is larger than the sum of its proper divisors (1).
134958958217 is an equidigital number, since it uses as much as digits as its factorization.
134958958217 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 21772800, while the sum is 62.
The spelling of 134958958217 in words is "one hundred thirty-four billion, nine hundred fifty-eight million, nine hundred fifty-eight thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •