Base | Representation |
---|---|
bin | 10011001101100011111… |
… | …010110110010110001101 |
3 | 11200012202012011120020121 |
4 | 103031203322312112031 |
5 | 133112313210044323 |
6 | 2450301135144541 |
7 | 164245364104324 |
oct | 23154372662615 |
9 | 4605665146217 |
10 | 1320231331213 |
11 | 4699a8193833 |
12 | 193a52975151 |
13 | 976606a9242 |
14 | 47c8448b0bb |
15 | 24520138a5d |
hex | 13363eb658d |
1320231331213 has 2 divisors, whose sum is σ = 1320231331214. Its totient is φ = 1320231331212.
The previous prime is 1320231331169. The next prime is 1320231331219. The reversal of 1320231331213 is 3121331320231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 725762574889 + 594468756324 = 851917^2 + 771018^2 .
It is a cyclic number.
It is not a de Polignac number, because 1320231331213 - 29 = 1320231330701 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1320231331219) 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, 660115665606 + 660115665607.
It is an arithmetic number, because the mean of its divisors is an integer number (660115665607).
Almost surely, 21320231331213 is an apocalyptic number.
It is an amenable number.
1320231331213 is a deficient number, since it is larger than the sum of its proper divisors (1).
1320231331213 is an equidigital number, since it uses as much as digits as its factorization.
1320231331213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 1320231331213 its reverse (3121331320231), we get a palindrome (4441562651444).
The spelling of 1320231331213 in words is "one trillion, three hundred twenty billion, two hundred thirty-one million, three hundred thirty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.201 sec. • engine limits •