Base | Representation |
---|---|
bin | 111101011001111… |
… | …100110100110101 |
3 | 2122210112020102222 |
4 | 331121330310311 |
5 | 4102213303132 |
6 | 250121012125 |
7 | 34346444126 |
oct | 7531746465 |
9 | 2583466388 |
10 | 1030212917 |
11 | 48958a238 |
12 | 249024045 |
13 | 135588056 |
14 | 9ab7404d |
15 | 6069d412 |
hex | 3d67cd35 |
1030212917 has 2 divisors, whose sum is σ = 1030212918. Its totient is φ = 1030212916.
The previous prime is 1030212899. The next prime is 1030212929. The reversal of 1030212917 is 7192120301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1026625681 + 3587236 = 32041^2 + 1894^2 .
It is an emirp because it is prime and its reverse (7192120301) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1030212917 is a prime.
It is a super-2 number, since 2×10302129172 = 2122677308707297778, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1030212217) 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, 515106458 + 515106459.
It is an arithmetic number, because the mean of its divisors is an integer number (515106459).
Almost surely, 21030212917 is an apocalyptic number.
It is an amenable number.
1030212917 is a deficient number, since it is larger than the sum of its proper divisors (1).
1030212917 is an equidigital number, since it uses as much as digits as its factorization.
1030212917 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 756, while the sum is 26.
The square root of 1030212917 is about 32096.9300245366. The cubic root of 1030212917 is about 1009.9712167074.
The spelling of 1030212917 in words is "one billion, thirty million, two hundred twelve thousand, nine hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •