Base | Representation |
---|---|
bin | 111101011010110… |
… | …010001011100101 |
3 | 2122210221100020012 |
4 | 331122302023211 |
5 | 4102242301321 |
6 | 250125420005 |
7 | 34351344233 |
oct | 7532621345 |
9 | 2583840205 |
10 | 1030431461 |
11 | 489719454 |
12 | 24910a605 |
13 | 135633677 |
14 | 9abcd953 |
15 | 606e305b |
hex | 3d6b22e5 |
1030431461 has 2 divisors, whose sum is σ = 1030431462. Its totient is φ = 1030431460.
The previous prime is 1030431419. The next prime is 1030431469. The reversal of 1030431461 is 1641340301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 610386436 + 420045025 = 24706^2 + 20495^2 .
It is an emirp because it is prime and its reverse (1641340301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1030431461 - 214 = 1030415077 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1030431469) 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, 515215730 + 515215731.
It is an arithmetic number, because the mean of its divisors is an integer number (515215731).
Almost surely, 21030431461 is an apocalyptic number.
It is an amenable number.
1030431461 is a deficient number, since it is larger than the sum of its proper divisors (1).
1030431461 is an equidigital number, since it uses as much as digits as its factorization.
1030431461 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 23.
The square root of 1030431461 is about 32100.3342817485. The cubic root of 1030431461 is about 1010.0426283351.
Adding to 1030431461 its reverse (1641340301), we get a palindrome (2671771762).
The spelling of 1030431461 in words is "one billion, thirty million, four hundred thirty-one thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •