Base | Representation |
---|---|
bin | 1001010100111100110… |
… | …10010100111001100001 |
3 | 1010122020011121010220012 |
4 | 10222132122110321201 |
5 | 20222323213001002 |
6 | 403121235454305 |
7 | 32103631641632 |
oct | 4523632247141 |
9 | 1118204533805 |
10 | 320485281377 |
11 | 113a0a64a408 |
12 | 52141a57395 |
13 | 242b5c07091 |
14 | 11723a6b889 |
15 | 850ad36d52 |
hex | 4a9e694e61 |
320485281377 has 2 divisors, whose sum is σ = 320485281378. Its totient is φ = 320485281376.
The previous prime is 320485281359. The next prime is 320485281379. The reversal of 320485281377 is 773182584023.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 210351566881 + 110133714496 = 458641^2 + 331864^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-320485281377 is a prime.
It is a super-2 number, since 2×3204852813772 (a number of 24 digits) contains 22 as substring.
Together with 320485281379, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (320485281379) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 160242640688 + 160242640689.
It is an arithmetic number, because the mean of its divisors is an integer number (160242640689).
Almost surely, 2320485281377 is an apocalyptic number.
It is an amenable number.
320485281377 is a deficient number, since it is larger than the sum of its proper divisors (1).
320485281377 is an equidigital number, since it uses as much as digits as its factorization.
320485281377 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2257920, while the sum is 50.
The spelling of 320485281377 in words is "three hundred twenty billion, four hundred eighty-five million, two hundred eighty-one thousand, three hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •