Base | Representation |
---|---|
bin | 111100100011111… |
… | …011001011110101 |
3 | 2121210212201011002 |
4 | 330203323023311 |
5 | 4040102103141 |
6 | 244453253045 |
7 | 34115200061 |
oct | 7443731365 |
9 | 2553781132 |
10 | 1016050421 |
11 | 4815967a1 |
12 | 244334185 |
13 | 132669989 |
14 | 98d28aa1 |
15 | 5e301e9b |
hex | 3c8fb2f5 |
1016050421 has 2 divisors, whose sum is σ = 1016050422. Its totient is φ = 1016050420.
The previous prime is 1016050381. The next prime is 1016050447. The reversal of 1016050421 is 1240506101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 945255025 + 70795396 = 30745^2 + 8414^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1016050421 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1016050393 and 1016050402.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1016050471) 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, 508025210 + 508025211.
It is an arithmetic number, because the mean of its divisors is an integer number (508025211).
Almost surely, 21016050421 is an apocalyptic number.
It is an amenable number.
1016050421 is a deficient number, since it is larger than the sum of its proper divisors (1).
1016050421 is an equidigital number, since it uses as much as digits as its factorization.
1016050421 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 240, while the sum is 20.
The square root of 1016050421 is about 31875.5458149347. The cubic root of 1016050421 is about 1005.3217688698.
Adding to 1016050421 its reverse (1240506101), we get a palindrome (2256556522).
The spelling of 1016050421 in words is "one billion, sixteen million, fifty thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •