Base | Representation |
---|---|
bin | 111110000000000011000101… |
… | …1010111110000101110100101 |
3 | 2122111222022211202122120101021 |
4 | 1330000012023113300232211 |
5 | 1032440222243023343432 |
6 | 5211520540312131141 |
7 | 222605164151025331 |
oct | 17400061327605645 |
9 | 2574868752576337 |
10 | 545364400606117 |
11 | 14885181a581214 |
12 | 511bb336396ab1 |
13 | 1a53c8471c4321 |
14 | 9895ac65087c1 |
15 | 430b2a6256697 |
hex | 1f0018b5f0ba5 |
545364400606117 has 2 divisors, whose sum is σ = 545364400606118. Its totient is φ = 545364400606116.
The previous prime is 545364400606099. The next prime is 545364400606141. The reversal of 545364400606117 is 711606004463545.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 325409814296161 + 219954586309956 = 18039119^2 + 14830866^2 .
It is a cyclic number.
It is not a de Polignac number, because 545364400606117 - 243 = 536568307583909 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (545364400606177) 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, 272682200303058 + 272682200303059.
It is an arithmetic number, because the mean of its divisors is an integer number (272682200303059).
Almost surely, 2545364400606117 is an apocalyptic number.
It is an amenable number.
545364400606117 is a deficient number, since it is larger than the sum of its proper divisors (1).
545364400606117 is an equidigital number, since it uses as much as digits as its factorization.
545364400606117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7257600, while the sum is 52.
The spelling of 545364400606117 in words is "five hundred forty-five trillion, three hundred sixty-four billion, four hundred million, six hundred six thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.137 sec. • engine limits •