Base | Representation |
---|---|
bin | 111101011010000… |
… | …110001100100101 |
3 | 2122210121012002121 |
4 | 331122012030211 |
5 | 4102221020201 |
6 | 250121505541 |
7 | 34346664052 |
oct | 7532061445 |
9 | 2583535077 |
10 | 1030251301 |
11 | 489606062 |
12 | 2490422b1 |
13 | 13559c671 |
14 | 9ab84029 |
15 | 606a99a1 |
hex | 3d686325 |
1030251301 has 2 divisors, whose sum is σ = 1030251302. Its totient is φ = 1030251300.
The previous prime is 1030251293. The next prime is 1030251311. The reversal of 1030251301 is 1031520301.
1030251301 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1019844225 + 10407076 = 31935^2 + 3226^2 .
It is a cyclic number.
It is not a de Polignac number, because 1030251301 - 23 = 1030251293 is a prime.
It is a super-2 number, since 2×10302513012 = 2122835486424385202, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1030251311) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 515125650 + 515125651.
It is an arithmetic number, because the mean of its divisors is an integer number (515125651).
Almost surely, 21030251301 is an apocalyptic number.
It is an amenable number.
1030251301 is a deficient number, since it is larger than the sum of its proper divisors (1).
1030251301 is an equidigital number, since it uses as much as digits as its factorization.
1030251301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 90, while the sum is 16.
The square root of 1030251301 is about 32097.5279577727. The cubic root of 1030251301 is about 1009.9837598277.
Adding to 1030251301 its reverse (1031520301), we get a palindrome (2061771602).
The spelling of 1030251301 in words is "one billion, thirty million, two hundred fifty-one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •