Base | Representation |
---|---|
bin | 100111010111101… |
… | …0101011011101001 |
3 | 10102001202100101221 |
4 | 1032233111123221 |
5 | 10201141001101 |
6 | 335030142041 |
7 | 44510403334 |
oct | 11657253351 |
9 | 3361670357 |
10 | 1321031401 |
11 | 618762498 |
12 | 30a4b1921 |
13 | 1808bc9b1 |
14 | c763761b |
15 | 7ae96aa1 |
hex | 4ebd56e9 |
1321031401 has 2 divisors, whose sum is σ = 1321031402. Its totient is φ = 1321031400.
The previous prime is 1321031399. The next prime is 1321031431. The reversal of 1321031401 is 1041301231.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 660541401 + 660490000 = 25701^2 + 25700^2 .
It is a cyclic number.
It is not a de Polignac number, because 1321031401 - 21 = 1321031399 is a prime.
Together with 1321031399, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (1321031431) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 660515700 + 660515701.
It is an arithmetic number, because the mean of its divisors is an integer number (660515701).
Almost surely, 21321031401 is an apocalyptic number.
1321031401 is the 25701-st centered square number.
It is an amenable number.
1321031401 is a deficient number, since it is larger than the sum of its proper divisors (1).
1321031401 is an equidigital number, since it uses as much as digits as its factorization.
1321031401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 16.
The square root of 1321031401 is about 36345.9956666481. The cubic root of 1321031401 is about 1097.2469449411.
Adding to 1321031401 its reverse (1041301231), we get a palindrome (2362332632).
The spelling of 1321031401 in words is "one billion, three hundred twenty-one million, thirty-one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •