Base | Representation |
---|---|
bin | 10101100001011111111011… |
… | …101000111111110110100101 |
3 | 110102011111121021022020102212 |
4 | 111201133323220333312211 |
5 | 44401411220023040221 |
6 | 533154355453413205 |
7 | 25640013655365062 |
oct | 2541377350776645 |
9 | 412144537266385 |
10 | 94661006065061 |
11 | 28186564130a07 |
12 | a749b2b49a205 |
13 | 40a86577524c7 |
14 | 195388d605c69 |
15 | ae253b3d5b5b |
hex | 5617fba3fda5 |
94661006065061 has 2 divisors, whose sum is σ = 94661006065062. Its totient is φ = 94661006065060.
The previous prime is 94661006065019. The next prime is 94661006065063. The reversal of 94661006065061 is 16056060016649.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 71091777380836 + 23569228684225 = 8431594^2 + 4854815^2 .
It is an emirp because it is prime and its reverse (16056060016649) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-94661006065061 is a prime.
Together with 94661006065063, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (94661006065063) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 47330503032530 + 47330503032531.
It is an arithmetic number, because the mean of its divisors is an integer number (47330503032531).
Almost surely, 294661006065061 is an apocalyptic number.
It is an amenable number.
94661006065061 is a deficient number, since it is larger than the sum of its proper divisors (1).
94661006065061 is an equidigital number, since it uses as much as digits as its factorization.
94661006065061 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1399680, while the sum is 50.
The spelling of 94661006065061 in words is "ninety-four trillion, six hundred sixty-one billion, six million, sixty-five thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •