Base | Representation |
---|---|
bin | 100100011100010001001000… |
… | …1101011111100101011111101 |
3 | 1120000221202020101211002200222 |
4 | 1020320202101223330223331 |
5 | 314003300010010432112 |
6 | 3053424030123031125 |
7 | 124342400061504221 |
oct | 11070422153745375 |
9 | 1500852211732628 |
10 | 320544443452157 |
11 | 93154153830401 |
12 | 2bb4b7b166b4a5 |
13 | 109b2299353ab2 |
14 | 5922610670781 |
15 | 270d16ae7d372 |
hex | 1238891afcafd |
320544443452157 has 2 divisors, whose sum is σ = 320544443452158. Its totient is φ = 320544443452156.
The previous prime is 320544443452133. The next prime is 320544443452229. The reversal of 320544443452157 is 751254344445023.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 314960055328996 + 5584388123161 = 17747114^2 + 2363131^2 .
It is a cyclic number.
It is not a de Polignac number, because 320544443452157 - 238 = 320269565545213 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 320544443452099 and 320544443452108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (320544443452117) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 160272221726078 + 160272221726079.
It is an arithmetic number, because the mean of its divisors is an integer number (160272221726079).
Almost surely, 2320544443452157 is an apocalyptic number.
It is an amenable number.
320544443452157 is a deficient number, since it is larger than the sum of its proper divisors (1).
320544443452157 is an equidigital number, since it uses as much as digits as its factorization.
320544443452157 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32256000, while the sum is 53.
The spelling of 320544443452157 in words is "three hundred twenty trillion, five hundred forty-four billion, four hundred forty-three million, four hundred fifty-two thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •