Base | Representation |
---|---|
bin | 100111101001100… |
… | …0101010001110101 |
3 | 10102201101110000202 |
4 | 1033103011101311 |
5 | 10211040334141 |
6 | 340003050245 |
7 | 44653143155 |
oct | 11723052165 |
9 | 3381343022 |
10 | 1330402421 |
11 | 622a83037 |
12 | 311670985 |
13 | 18282118a |
14 | c8996765 |
15 | 7bbe849b |
hex | 4f4c5475 |
1330402421 has 2 divisors, whose sum is σ = 1330402422. Its totient is φ = 1330402420.
The previous prime is 1330402397. The next prime is 1330402427. The reversal of 1330402421 is 1242040331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1055340196 + 275062225 = 32486^2 + 16585^2 .
It is a cyclic number.
It is not a de Polignac number, because 1330402421 - 230 = 256660597 is a prime.
It is a super-2 number, since 2×13304024212 = 3539941203605322482, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1330402393 and 1330402402.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1330402427) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 665201210 + 665201211.
It is an arithmetic number, because the mean of its divisors is an integer number (665201211).
Almost surely, 21330402421 is an apocalyptic number.
It is an amenable number.
1330402421 is a deficient number, since it is larger than the sum of its proper divisors (1).
1330402421 is an equidigital number, since it uses as much as digits as its factorization.
1330402421 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 576, while the sum is 20.
The square root of 1330402421 is about 36474.6819177358. The cubic root of 1330402421 is about 1099.8353530430.
Adding to 1330402421 its reverse (1242040331), we get a palindrome (2572442752).
The spelling of 1330402421 in words is "one billion, three hundred thirty million, four hundred two thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •