Base | Representation |
---|---|
bin | 111101011001100… |
… | …110011100010101 |
3 | 2122210100120200102 |
4 | 331121212130111 |
5 | 4102202334422 |
6 | 250115023445 |
7 | 34345612625 |
oct | 7531463425 |
9 | 2583316612 |
10 | 1030121237 |
11 | 489527372 |
12 | 248b9ab85 |
13 | 1355553c2 |
14 | 9ab4c885 |
15 | 60681192 |
hex | 3d666715 |
1030121237 has 2 divisors, whose sum is σ = 1030121238. Its totient is φ = 1030121236.
The previous prime is 1030121167. The next prime is 1030121249. The reversal of 1030121237 is 7321210301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1029703921 + 417316 = 32089^2 + 646^2 .
It is a cyclic number.
It is not a de Polignac number, because 1030121237 - 210 = 1030120213 is a prime.
It is a super-2 number, since 2×10301212372 = 2122299525836820338, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1030121737) 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, 515060618 + 515060619.
It is an arithmetic number, because the mean of its divisors is an integer number (515060619).
Almost surely, 21030121237 is an apocalyptic number.
It is an amenable number.
1030121237 is a deficient number, since it is larger than the sum of its proper divisors (1).
1030121237 is an equidigital number, since it uses as much as digits as its factorization.
1030121237 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 252, while the sum is 20.
The square root of 1030121237 is about 32095.5018187907. The cubic root of 1030121237 is about 1009.9412562638.
Adding to 1030121237 its reverse (7321210301), we get a palindrome (8351331538).
The spelling of 1030121237 in words is "one billion, thirty million, one hundred twenty-one thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •