Base | Representation |
---|---|
bin | 111100101111110011001011… |
… | …0000100111001011100001101 |
3 | 2121001220221022010121222020222 |
4 | 1321133212112010321130031 |
5 | 1030014021243133204232 |
6 | 5132234054052521125 |
7 | 220356303000250466 |
oct | 17137462604713415 |
9 | 2531827263558228 |
10 | 534335104194317 |
11 | 14528a277259528 |
12 | 4bb198813201a5 |
13 | 19c1c77940287a |
14 | 95d3d58157d6d |
15 | 41b9437b03d12 |
hex | 1e5f99613970d |
534335104194317 has 2 divisors, whose sum is σ = 534335104194318. Its totient is φ = 534335104194316.
The previous prime is 534335104194293. The next prime is 534335104194319. The reversal of 534335104194317 is 713491401533435.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 509748292691236 + 24586811503081 = 22577606^2 + 4958509^2 .
It is a cyclic number.
It is not a de Polignac number, because 534335104194317 - 216 = 534335104128781 is a prime.
Together with 534335104194319, 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 (534335104194319) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 267167552097158 + 267167552097159.
It is an arithmetic number, because the mean of its divisors is an integer number (267167552097159).
Almost surely, 2534335104194317 is an apocalyptic number.
It is an amenable number.
534335104194317 is a deficient number, since it is larger than the sum of its proper divisors (1).
534335104194317 is an equidigital number, since it uses as much as digits as its factorization.
534335104194317 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8164800, while the sum is 53.
The spelling of 534335104194317 in words is "five hundred thirty-four trillion, three hundred thirty-five billion, one hundred four million, one hundred ninety-four thousand, three hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •