Base | Representation |
---|---|
bin | 1001010100101001010… |
… | …00000001100011101101 |
3 | 1010121210201122212101221 |
4 | 10222110220001203231 |
5 | 20222004200200023 |
6 | 403053052503341 |
7 | 32066566266025 |
oct | 4522450014355 |
9 | 1117721585357 |
10 | 320321100013 |
11 | 113935a01532 |
12 | 520b6a7ab51 |
13 | 2428abb1345 |
14 | 11709d30a85 |
15 | 84eb70585d |
hex | 4a94a018ed |
320321100013 has 2 divisors, whose sum is σ = 320321100014. Its totient is φ = 320321100012.
The previous prime is 320321099951. The next prime is 320321100053. The reversal of 320321100013 is 310001123023.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 286949848329 + 33371251684 = 535677^2 + 182678^2 .
It is a cyclic number.
It is not a de Polignac number, because 320321100013 - 213 = 320321091821 is a prime.
It is a super-2 number, since 2×3203211000132 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 320321100013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (320321100053) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 160160550006 + 160160550007.
It is an arithmetic number, because the mean of its divisors is an integer number (160160550007).
Almost surely, 2320321100013 is an apocalyptic number.
It is an amenable number.
320321100013 is a deficient number, since it is larger than the sum of its proper divisors (1).
320321100013 is an equidigital number, since it uses as much as digits as its factorization.
320321100013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 320321100013 its reverse (310001123023), we get a palindrome (630322223036).
The spelling of 320321100013 in words is "three hundred twenty billion, three hundred twenty-one million, one hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •