Base | Representation |
---|---|
bin | 101010001101100… |
… | …1101111010101001 |
3 | 10122201020122101021 |
4 | 1110123031322221 |
5 | 10400100433113 |
6 | 352314452441 |
7 | 50046244246 |
oct | 12433157251 |
9 | 3581218337 |
10 | 1416421033 |
11 | 6675950a5 |
12 | 336434121 |
13 | 1975aab71 |
14 | d61885cd |
15 | 8453a48d |
hex | 546cdea9 |
1416421033 has 2 divisors, whose sum is σ = 1416421034. Its totient is φ = 1416421032.
The previous prime is 1416421007. The next prime is 1416421043. The reversal of 1416421033 is 3301246141.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1202910489 + 213510544 = 34683^2 + 14612^2 .
It is a cyclic number.
It is not a de Polignac number, because 1416421033 - 29 = 1416420521 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1416420989 and 1416421007.
It is not a weakly prime, because it can be changed into another prime (1416421043) 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, 708210516 + 708210517.
It is an arithmetic number, because the mean of its divisors is an integer number (708210517).
Almost surely, 21416421033 is an apocalyptic number.
It is an amenable number.
1416421033 is a deficient number, since it is larger than the sum of its proper divisors (1).
1416421033 is an equidigital number, since it uses as much as digits as its factorization.
1416421033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 25.
The square root of 1416421033 is about 37635.3694415240. The cubic root of 1416421033 is about 1123.0457682343.
Adding to 1416421033 its reverse (3301246141), we get a palindrome (4717667174).
The spelling of 1416421033 in words is "one billion, four hundred sixteen million, four hundred twenty-one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •