Base | Representation |
---|---|
bin | 1001010100101011100… |
… | …00111000110000011001 |
3 | 1010121212001121021022101 |
4 | 10222111300320300121 |
5 | 20222024042403343 |
6 | 403055014123401 |
7 | 32100220530346 |
oct | 4522560706031 |
9 | 1117761537271 |
10 | 320340200473 |
11 | 113945767a37 |
12 | 52101350561 |
13 | 24291b3b1a7 |
14 | 1170c6a37cd |
15 | 84ed229e4d |
hex | 4a95c38c19 |
320340200473 has 2 divisors, whose sum is σ = 320340200474. Its totient is φ = 320340200472.
The previous prime is 320340200437. The next prime is 320340200483. The reversal of 320340200473 is 374002043023.
Together with previous prime (320340200437) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 315903574809 + 4436625664 = 562053^2 + 66608^2 .
It is a cyclic number.
It is not a de Polignac number, because 320340200473 - 29 = 320340199961 is a prime.
It is not a weakly prime, because it can be changed into another prime (320340200483) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 160170100236 + 160170100237.
It is an arithmetic number, because the mean of its divisors is an integer number (160170100237).
Almost surely, 2320340200473 is an apocalyptic number.
It is an amenable number.
320340200473 is a deficient number, since it is larger than the sum of its proper divisors (1).
320340200473 is an equidigital number, since it uses as much as digits as its factorization.
320340200473 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12096, while the sum is 28.
Adding to 320340200473 its reverse (374002043023), we get a palindrome (694342243496).
The spelling of 320340200473 in words is "three hundred twenty billion, three hundred forty million, two hundred thousand, four hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •