Base | Representation |
---|---|
bin | 1111101001101001100100… |
… | …10100011101011010010001 |
3 | 11111212011210021202022202001 |
4 | 13310310302110131122101 |
5 | 14002334310243320433 |
6 | 201110403410154001 |
7 | 10151334621045061 |
oct | 764646224353221 |
9 | 144764707668661 |
10 | 34416417166993 |
11 | aa69a14290624 |
12 | 3a3a170582901 |
13 | 16285b9ba15c4 |
14 | 86da98db33a1 |
15 | 3ea3b3ac857d |
hex | 1f4d3251d691 |
34416417166993 has 2 divisors, whose sum is σ = 34416417166994. Its totient is φ = 34416417166992.
The previous prime is 34416417166951. The next prime is 34416417167051. The reversal of 34416417166993 is 39966171461443.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 34416385436304 + 31730689 = 5866548^2 + 5633^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-34416417166993 is a prime.
It is a super-2 number, since 2×344164171669932 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (34416417166903) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 17208208583496 + 17208208583497.
It is an arithmetic number, because the mean of its divisors is an integer number (17208208583497).
Almost surely, 234416417166993 is an apocalyptic number.
It is an amenable number.
34416417166993 is a deficient number, since it is larger than the sum of its proper divisors (1).
34416417166993 is an equidigital number, since it uses as much as digits as its factorization.
34416417166993 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 70543872, while the sum is 64.
The spelling of 34416417166993 in words is "thirty-four trillion, four hundred sixteen billion, four hundred seventeen million, one hundred sixty-six thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •