Base | Representation |
---|---|
bin | 1001010100010011101… |
… | …01001011111110111101 |
3 | 1010121100002220002112222 |
4 | 10222021311023332331 |
5 | 20221121320014323 |
6 | 403023103135125 |
7 | 32062240053134 |
oct | 4521165137675 |
9 | 1117302802488 |
10 | 320140001213 |
11 | 1138527592aa |
12 | 520662a44a5 |
13 | 2425c5142a6 |
14 | 116cdc6c91b |
15 | 84da8819c8 |
hex | 4a89d4bfbd |
320140001213 has 2 divisors, whose sum is σ = 320140001214. Its totient is φ = 320140001212.
The previous prime is 320140001161. The next prime is 320140001221. The reversal of 320140001213 is 312100041023.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 182857153924 + 137282847289 = 427618^2 + 370517^2 .
It is a cyclic number.
It is not a de Polignac number, because 320140001213 - 216 = 320139935677 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 320140001191 and 320140001200.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (320140001263) 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, 160070000606 + 160070000607.
It is an arithmetic number, because the mean of its divisors is an integer number (160070000607).
Almost surely, 2320140001213 is an apocalyptic number.
It is an amenable number.
320140001213 is a deficient number, since it is larger than the sum of its proper divisors (1).
320140001213 is an equidigital number, since it uses as much as digits as its factorization.
320140001213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 320140001213 its reverse (312100041023), we get a palindrome (632240042236).
The spelling of 320140001213 in words is "three hundred twenty billion, one hundred forty million, one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •