Base | Representation |
---|---|
bin | 111100101110001010100101… |
… | …1010111110001010100011101 |
3 | 2121001010110120221211101021112 |
4 | 1321130111023113301110131 |
5 | 1030001331312203114242 |
6 | 5131542552050311405 |
7 | 220334132260631111 |
oct | 17134251327612435 |
9 | 2531113527741245 |
10 | 534110512551197 |
11 | 145202aa611492a |
12 | 4baa2241b88565 |
13 | 19c0453635649a |
14 | 95c713002b741 |
15 | 41b3690771c82 |
hex | 1e5c54b5f151d |
534110512551197 has 2 divisors, whose sum is σ = 534110512551198. Its totient is φ = 534110512551196.
The previous prime is 534110512551151. The next prime is 534110512551257. The reversal of 534110512551197 is 791155215011435.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 532299695567641 + 1810816983556 = 23071621^2 + 1345666^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-534110512551197 is a prime.
It is a super-2 number, since 2×5341105125511972 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (534110512554197) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 267055256275598 + 267055256275599.
It is an arithmetic number, because the mean of its divisors is an integer number (267055256275599).
Almost surely, 2534110512551197 is an apocalyptic number.
It is an amenable number.
534110512551197 is a deficient number, since it is larger than the sum of its proper divisors (1).
534110512551197 is an equidigital number, since it uses as much as digits as its factorization.
534110512551197 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 945000, while the sum is 50.
The spelling of 534110512551197 in words is "five hundred thirty-four trillion, one hundred ten billion, five hundred twelve million, five hundred fifty-one thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •