Base | Representation |
---|---|
bin | 100111001010111… |
… | …0001011001101101 |
3 | 10101121010220010002 |
4 | 1032111301121231 |
5 | 10142432031341 |
6 | 334230354045 |
7 | 44366423351 |
oct | 11625613155 |
9 | 3347126102 |
10 | 1314330221 |
11 | 6149a5826 |
12 | 3081bb925 |
13 | 17c3b47b9 |
14 | c67b1461 |
15 | 7a5c129b |
hex | 4e57166d |
1314330221 has 2 divisors, whose sum is σ = 1314330222. Its totient is φ = 1314330220.
The previous prime is 1314330211. The next prime is 1314330229. The reversal of 1314330221 is 1220334131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1089660100 + 224670121 = 33010^2 + 14989^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1314330221 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1314330193 and 1314330202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1314330229) 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, 657165110 + 657165111.
It is an arithmetic number, because the mean of its divisors is an integer number (657165111).
Almost surely, 21314330221 is an apocalyptic number.
It is an amenable number.
1314330221 is a deficient number, since it is larger than the sum of its proper divisors (1).
1314330221 is an equidigital number, since it uses as much as digits as its factorization.
1314330221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 20.
The square root of 1314330221 is about 36253.6925153839. The cubic root of 1314330221 is about 1095.3884684666.
Adding to 1314330221 its reverse (1220334131), we get a palindrome (2534664352).
The spelling of 1314330221 in words is "one billion, three hundred fourteen million, three hundred thirty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •