Base | Representation |
---|---|
bin | 1001010110011101111… |
… | …10010100001011111101 |
3 | 1010201022221200020221022 |
4 | 10223032332110023331 |
5 | 20231010301201023 |
6 | 403334142313525 |
7 | 32133054061025 |
oct | 4531676241375 |
9 | 1121287606838 |
10 | 321300022013 |
11 | 114298539083 |
12 | 5232a8888a5 |
13 | 243b594b529 |
14 | 1179dd52a85 |
15 | 85576217c8 |
hex | 4acef942fd |
321300022013 has 2 divisors, whose sum is σ = 321300022014. Its totient is φ = 321300022012.
The previous prime is 321300021997. The next prime is 321300022027. The reversal of 321300022013 is 310220003123.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 209568937369 + 111731084644 = 457787^2 + 334262^2 .
It is a cyclic number.
It is not a de Polignac number, because 321300022013 - 24 = 321300021997 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 321300021982 and 321300022000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (321300022313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 160650011006 + 160650011007.
It is an arithmetic number, because the mean of its divisors is an integer number (160650011007).
Almost surely, 2321300022013 is an apocalyptic number.
It is an amenable number.
321300022013 is a deficient number, since it is larger than the sum of its proper divisors (1).
321300022013 is an equidigital number, since it uses as much as digits as its factorization.
321300022013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 321300022013 its reverse (310220003123), we get a palindrome (631520025136).
The spelling of 321300022013 in words is "three hundred twenty-one billion, three hundred million, twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •