Base | Representation |
---|---|
bin | 111101011001101… |
… | …011010111101001 |
3 | 2122210101121100211 |
4 | 331121223113221 |
5 | 4102204011132 |
6 | 250115301121 |
7 | 34346025514 |
oct | 7531532751 |
9 | 2583347324 |
10 | 1030141417 |
11 | 489540548 |
12 | 248baa7a1 |
13 | 135561646 |
14 | 9ab55d7b |
15 | 60687147 |
hex | 3d66b5e9 |
1030141417 has 2 divisors, whose sum is σ = 1030141418. Its totient is φ = 1030141416.
The previous prime is 1030141381. The next prime is 1030141421. The reversal of 1030141417 is 7141410301.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1029832281 + 309136 = 32091^2 + 556^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1030141417 is a prime.
It is a super-2 number, since 2×10301414172 = 2122382678037535778, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1030141517) 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, 515070708 + 515070709.
It is an arithmetic number, because the mean of its divisors is an integer number (515070709).
Almost surely, 21030141417 is an apocalyptic number.
It is an amenable number.
1030141417 is a deficient number, since it is larger than the sum of its proper divisors (1).
1030141417 is an equidigital number, since it uses as much as digits as its factorization.
1030141417 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 336, while the sum is 22.
The square root of 1030141417 is about 32095.8161915225. The cubic root of 1030141417 is about 1009.9478511126.
Adding to 1030141417 its reverse (7141410301), we get a palindrome (8171551718).
The spelling of 1030141417 in words is "one billion, thirty million, one hundred forty-one thousand, four hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •