Base | Representation |
---|---|
bin | 1001010100101010010… |
… | …10000110001110001101 |
3 | 1010121211100110122210202 |
4 | 10222111022012032031 |
5 | 20222013442011023 |
6 | 403054012143245 |
7 | 32100035226605 |
oct | 4522512061615 |
9 | 1117740418722 |
10 | 320330032013 |
11 | 11393aa52252 |
12 | 520b9a67b25 |
13 | 2428c9baa54 |
14 | 1170b1b7c05 |
15 | 84ec3bc128 |
hex | 4a9528638d |
320330032013 has 2 divisors, whose sum is σ = 320330032014. Its totient is φ = 320330032012.
The previous prime is 320330032007. The next prime is 320330032039. The reversal of 320330032013 is 310230033023.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 226555056484 + 93774975529 = 475978^2 + 306227^2 .
It is a cyclic number.
It is not a de Polignac number, because 320330032013 - 224 = 320313254797 is a prime.
It is a super-2 number, since 2×3203300320132 (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 (320330032073) 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, 160165016006 + 160165016007.
It is an arithmetic number, because the mean of its divisors is an integer number (160165016007).
Almost surely, 2320330032013 is an apocalyptic number.
It is an amenable number.
320330032013 is a deficient number, since it is larger than the sum of its proper divisors (1).
320330032013 is an equidigital number, since it uses as much as digits as its factorization.
320330032013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972, while the sum is 20.
Adding to 320330032013 its reverse (310230033023), we get a palindrome (630560065036).
The spelling of 320330032013 in words is "three hundred twenty billion, three hundred thirty million, thirty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •