Base | Representation |
---|---|
bin | 1001010100101010011… |
… | …01110010100011001101 |
3 | 1010121211102021211122121 |
4 | 10222111031302203031 |
5 | 20222014214000023 |
6 | 403054045012541 |
7 | 32100046401013 |
oct | 4522515624315 |
9 | 1117742254577 |
10 | 320331000013 |
11 | 113940553552 |
12 | 520ba254151 |
13 | 2428cc6952b |
14 | 1170b38a8b3 |
15 | 84ec50dd5d |
hex | 4a953728cd |
320331000013 has 2 divisors, whose sum is σ = 320331000014. Its totient is φ = 320331000012.
The previous prime is 320330999999. The next prime is 320331000151. The reversal of 320331000013 is 310000133023.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 313854291529 + 6476708484 = 560227^2 + 80478^2 .
It is a cyclic number.
It is not a de Polignac number, because 320331000013 - 25 = 320330999981 is a prime.
It is a super-2 number, since 2×3203310000132 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (320331000313) 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, 160165500006 + 160165500007.
It is an arithmetic number, because the mean of its divisors is an integer number (160165500007).
Almost surely, 2320331000013 is an apocalyptic number.
It is an amenable number.
320331000013 is a deficient number, since it is larger than the sum of its proper divisors (1).
320331000013 is an equidigital number, since it uses as much as digits as its factorization.
320331000013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162, while the sum is 16.
Adding to 320331000013 its reverse (310000133023), we get a palindrome (630331133036).
The spelling of 320331000013 in words is "three hundred twenty billion, three hundred thirty-one million, thirteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •