Base | Representation |
---|---|
bin | 1001010101010111110… |
… | …11101001000000101001 |
3 | 1010122210222102122200012 |
4 | 10222223323221000221 |
5 | 20223304300241223 |
6 | 403155541421305 |
7 | 32112355012046 |
oct | 4525373510051 |
9 | 1118728378605 |
10 | 320712118313 |
11 | 1140166a2354 |
12 | 521a5a0a835 |
13 | 24320bc9712 |
14 | 11745c381cd |
15 | 8520be2c78 |
hex | 4aabee9029 |
320712118313 has 2 divisors, whose sum is σ = 320712118314. Its totient is φ = 320712118312.
The previous prime is 320712118301. The next prime is 320712118339. The reversal of 320712118313 is 313811217023.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 251254570009 + 69457548304 = 501253^2 + 263548^2 .
It is an emirp because it is prime and its reverse (313811217023) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 320712118313 - 216 = 320712052777 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 320712118313.
It is not a weakly prime, because it can be changed into another prime (320712115313) 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, 160356059156 + 160356059157.
It is an arithmetic number, because the mean of its divisors is an integer number (160356059157).
Almost surely, 2320712118313 is an apocalyptic number.
It is an amenable number.
320712118313 is a deficient number, since it is larger than the sum of its proper divisors (1).
320712118313 is an equidigital number, since it uses as much as digits as its factorization.
320712118313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6048, while the sum is 32.
The spelling of 320712118313 in words is "three hundred twenty billion, seven hundred twelve million, one hundred eighteen thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •