Base | Representation |
---|---|
bin | 111101000011100110100000… |
… | …1110010100101001010100101 |
3 | 2121102120010012210002220212221 |
4 | 1322013031001302211022211 |
5 | 1030343114110014402242 |
6 | 5142120235222512341 |
7 | 221060031444463414 |
oct | 17207150162451245 |
9 | 2542503183086787 |
10 | 537056699372197 |
11 | 146139515835754 |
12 | 50299229b956b1 |
13 | 1a0892ca116724 |
14 | 968997bdd147b |
15 | 42151259a0167 |
hex | 1e87341ca52a5 |
537056699372197 has 2 divisors, whose sum is σ = 537056699372198. Its totient is φ = 537056699372196.
The previous prime is 537056699372159. The next prime is 537056699372209. The reversal of 537056699372197 is 791273996650735.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 427234389783201 + 109822309588996 = 20669649^2 + 10479614^2 .
It is a cyclic number.
It is not a de Polignac number, because 537056699372197 - 215 = 537056699339429 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (537056699372107) 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, 268528349686098 + 268528349686099.
It is an arithmetic number, because the mean of its divisors is an integer number (268528349686099).
Almost surely, 2537056699372197 is an apocalyptic number.
It is an amenable number.
537056699372197 is a deficient number, since it is larger than the sum of its proper divisors (1).
537056699372197 is an equidigital number, since it uses as much as digits as its factorization.
537056699372197 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4050761400, while the sum is 79.
The spelling of 537056699372197 in words is "five hundred thirty-seven trillion, fifty-six billion, six hundred ninety-nine million, three hundred seventy-two thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •