Base | Representation |
---|---|
bin | 100111001000010… |
… | …1100111111001101 |
3 | 10101111122101100021 |
4 | 1032100230333031 |
5 | 10142112021141 |
6 | 334142102141 |
7 | 44352220324 |
oct | 11620547715 |
9 | 3344571307 |
10 | 1313001421 |
11 | 614178446 |
12 | 30787a951 |
13 | 17c03aa24 |
14 | c65470bb |
15 | 7a40c6d1 |
hex | 4e42cfcd |
1313001421 has 2 divisors, whose sum is σ = 1313001422. Its totient is φ = 1313001420.
The previous prime is 1313001413. The next prime is 1313001439. The reversal of 1313001421 is 1241003131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1280852521 + 32148900 = 35789^2 + 5670^2 .
It is a cyclic number.
It is not a de Polignac number, because 1313001421 - 23 = 1313001413 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1313001395 and 1313001404.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1313001401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 656500710 + 656500711.
It is an arithmetic number, because the mean of its divisors is an integer number (656500711).
Almost surely, 21313001421 is an apocalyptic number.
It is an amenable number.
1313001421 is a deficient number, since it is larger than the sum of its proper divisors (1).
1313001421 is an equidigital number, since it uses as much as digits as its factorization.
1313001421 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 1313001421 is about 36235.3614719103. The cubic root of 1313001421 is about 1095.0191947039.
Adding to 1313001421 its reverse (1241003131), we get a palindrome (2554004552).
The spelling of 1313001421 in words is "one billion, three hundred thirteen million, one thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •