Base | Representation |
---|---|
bin | 111101011001010… |
… | …000011111000001 |
3 | 2122210012000022022 |
4 | 331121100133001 |
5 | 4102142000142 |
6 | 250113051225 |
7 | 34345056461 |
oct | 7531203701 |
9 | 2583160268 |
10 | 1030031297 |
11 | 489475839 |
12 | 248b56b15 |
13 | 135523499 |
14 | 9ab27ba1 |
15 | 606646d2 |
hex | 3d6507c1 |
1030031297 has 2 divisors, whose sum is σ = 1030031298. Its totient is φ = 1030031296.
The previous prime is 1030031281. The next prime is 1030031323. The reversal of 1030031297 is 7921300301.
1030031297 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an a-pointer prime, because the next prime (1030031323) can be obtained adding 1030031297 to its sum of digits (26).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 611869696 + 418161601 = 24736^2 + 20449^2 .
It is a cyclic number.
It is not a de Polignac number, because 1030031297 - 24 = 1030031281 is a prime.
It is not a weakly prime, because it can be changed into another prime (1030031227) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 515015648 + 515015649.
It is an arithmetic number, because the mean of its divisors is an integer number (515015649).
Almost surely, 21030031297 is an apocalyptic number.
It is an amenable number.
1030031297 is a deficient number, since it is larger than the sum of its proper divisors (1).
1030031297 is an equidigital number, since it uses as much as digits as its factorization.
1030031297 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1134, while the sum is 26.
The square root of 1030031297 is about 32094.1006572859. The cubic root of 1030031297 is about 1009.9118627138.
Adding to 1030031297 its reverse (7921300301), we get a palindrome (8951331598).
The spelling of 1030031297 in words is "one billion, thirty million, thirty-one thousand, two hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •