Base | Representation |
---|---|
bin | 111101011010000… |
… | …110001100101111 |
3 | 2122210121012002222 |
4 | 331122012030233 |
5 | 4102221020221 |
6 | 250121505555 |
7 | 34346664065 |
oct | 7532061457 |
9 | 2583535088 |
10 | 1030251311 |
11 | 489606071 |
12 | 2490422bb |
13 | 13559c67b |
14 | 9ab84035 |
15 | 606a99ab |
hex | 3d68632f |
1030251311 has 2 divisors, whose sum is σ = 1030251312. Its totient is φ = 1030251310.
The previous prime is 1030251301. The next prime is 1030251359. The reversal of 1030251311 is 1131520301.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1030251311 - 26 = 1030251247 is a prime.
It is a super-2 number, since 2×10302513112 = 2122835527634437442, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1030251311.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1030251301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 515125655 + 515125656.
It is an arithmetic number, because the mean of its divisors is an integer number (515125656).
Almost surely, 21030251311 is an apocalyptic number.
1030251311 is a deficient number, since it is larger than the sum of its proper divisors (1).
1030251311 is an equidigital number, since it uses as much as digits as its factorization.
1030251311 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 17.
The square root of 1030251311 is about 32097.5281135479. The cubic root of 1030251311 is about 1009.9837630955.
Adding to 1030251311 its reverse (1131520301), we get a palindrome (2161771612).
The spelling of 1030251311 in words is "one billion, thirty million, two hundred fifty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •