Base | Representation |
---|---|
bin | 11111111000101011010010… |
… | …01111000101111001110001 |
3 | 100012021010111201111001100202 |
4 | 33330111221033011321301 |
5 | 33142244313301434332 |
6 | 405043204253524545 |
7 | 20524536160641404 |
oct | 1774255117057161 |
9 | 305233451431322 |
10 | 70117106671217 |
11 | 20383552848531 |
12 | 7a451b91a3755 |
13 | 30180266479b8 |
14 | 1345986811d3b |
15 | 818d90978a62 |
hex | 3fc5693c5e71 |
70117106671217 has 2 divisors, whose sum is σ = 70117106671218. Its totient is φ = 70117106671216.
The previous prime is 70117106671151. The next prime is 70117106671219. The reversal of 70117106671217 is 71217660171107.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 48384391780321 + 21732714890896 = 6955889^2 + 4661836^2 .
It is a cyclic number.
It is not a de Polignac number, because 70117106671217 - 228 = 70116838235761 is a prime.
It is a super-2 number, since 2×701171066712172 (a number of 28 digits) contains 22 as substring.
Together with 70117106671219, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (70117106671219) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 35058553335608 + 35058553335609.
It is an arithmetic number, because the mean of its divisors is an integer number (35058553335609).
Almost surely, 270117106671217 is an apocalyptic number.
It is an amenable number.
70117106671217 is a deficient number, since it is larger than the sum of its proper divisors (1).
70117106671217 is an equidigital number, since it uses as much as digits as its factorization.
70117106671217 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 172872, while the sum is 47.
The spelling of 70117106671217 in words is "seventy trillion, one hundred seventeen billion, one hundred six million, six hundred seventy-one thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.142 sec. • engine limits •