Base | Representation |
---|---|
bin | 101111111110101000… |
… | …0001100110011111101 |
3 | 100211221120000022201122 |
4 | 1133331100030303331 |
5 | 3142002440131422 |
6 | 115155513320325 |
7 | 10305154104542 |
oct | 1377520146375 |
9 | 324846008648 |
10 | 103033130237 |
11 | 3a772574804 |
12 | 17b757060a5 |
13 | 994002396b |
14 | 4db5c0cbc9 |
15 | 2a30674d42 |
hex | 17fd40ccfd |
103033130237 has 2 divisors, whose sum is σ = 103033130238. Its totient is φ = 103033130236.
The previous prime is 103033130203. The next prime is 103033130297. The reversal of 103033130237 is 732031330301.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 102618356281 + 414773956 = 320341^2 + 20366^2 .
It is a cyclic number.
It is not a de Polignac number, because 103033130237 - 28 = 103033129981 is a prime.
It is a super-4 number, since 4×1030331302374 (a number of 45 digits) contains 4444 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103033130297) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51516565118 + 51516565119.
It is an arithmetic number, because the mean of its divisors is an integer number (51516565119).
Almost surely, 2103033130237 is an apocalyptic number.
It is an amenable number.
103033130237 is a deficient number, since it is larger than the sum of its proper divisors (1).
103033130237 is an equidigital number, since it uses as much as digits as its factorization.
103033130237 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3402, while the sum is 26.
Adding to 103033130237 its reverse (732031330301), we get a palindrome (835064460538).
The spelling of 103033130237 in words is "one hundred three billion, thirty-three million, one hundred thirty thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •