Base | Representation |
---|---|
bin | 111101111101100011110100… |
… | …0111101001001010110111101 |
3 | 2122110202122000021221101002111 |
4 | 1323323013220331021112331 |
5 | 1032414121310031204431 |
6 | 5211055453300054021 |
7 | 222541365330645424 |
oct | 17373075075112675 |
9 | 2573678007841074 |
10 | 545022373303741 |
11 | 14872a766031673 |
12 | 51164ba2094311 |
13 | 1a51650a2c9978 |
14 | 988331b8742bb |
15 | 43024391087b1 |
hex | 1efb1e8f495bd |
545022373303741 has 2 divisors, whose sum is σ = 545022373303742. Its totient is φ = 545022373303740.
The previous prime is 545022373303697. The next prime is 545022373303769. The reversal of 545022373303741 is 147303373220545.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 407768355225625 + 137254018078116 = 20193275^2 + 11715546^2 .
It is a cyclic number.
It is not a de Polignac number, because 545022373303741 - 27 = 545022373303613 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (545022373303781) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 272511186651870 + 272511186651871.
It is an arithmetic number, because the mean of its divisors is an integer number (272511186651871).
Almost surely, 2545022373303741 is an apocalyptic number.
It is an amenable number.
545022373303741 is a deficient number, since it is larger than the sum of its proper divisors (1).
545022373303741 is an equidigital number, since it uses as much as digits as its factorization.
545022373303741 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6350400, while the sum is 49.
The spelling of 545022373303741 in words is "five hundred forty-five trillion, twenty-two billion, three hundred seventy-three million, three hundred three thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •