Base | Representation |
---|---|
bin | 111101011001110… |
… | …010110011010101 |
3 | 2122210110011010101 |
4 | 331121302303111 |
5 | 4102210444421 |
6 | 250120054101 |
7 | 34346213335 |
oct | 7531626325 |
9 | 2583404111 |
10 | 1030171861 |
11 | 489561404 |
12 | 249004331 |
13 | 135572464 |
14 | 9ab630c5 |
15 | 60691191 |
hex | 3d672cd5 |
1030171861 has 2 divisors, whose sum is σ = 1030171862. Its totient is φ = 1030171860.
The previous prime is 1030171859. The next prime is 1030171889. The reversal of 1030171861 is 1681710301.
It is an a-pointer prime, because the next prime (1030171889) can be obtained adding 1030171861 to its sum of digits (28).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 515744100 + 514427761 = 22710^2 + 22681^2 .
It is a cyclic number.
It is not a de Polignac number, because 1030171861 - 21 = 1030171859 is a prime.
It is a super-2 number, since 2×10301718612 = 2122508126392406642, which contains 22 as substring.
Together with 1030171859, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1030171361) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 515085930 + 515085931.
It is an arithmetic number, because the mean of its divisors is an integer number (515085931).
Almost surely, 21030171861 is an apocalyptic number.
It is an amenable number.
1030171861 is a deficient number, since it is larger than the sum of its proper divisors (1).
1030171861 is an equidigital number, since it uses as much as digits as its factorization.
1030171861 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1008, while the sum is 28.
The square root of 1030171861 is about 32096.2904554405. The cubic root of 1030171861 is about 1009.9578000863.
The spelling of 1030171861 in words is "one billion, thirty million, one hundred seventy-one thousand, eight hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •