Base | Representation |
---|---|
bin | 10011011000001001… |
… | …01100010111101101 |
3 | 222212000021110011221 |
4 | 21230010230113231 |
5 | 132301143313422 |
6 | 4440142343341 |
7 | 515540632651 |
oct | 115404542755 |
9 | 28760243157 |
10 | 10403104237 |
11 | 4459310209 |
12 | 2023b8ab51 |
13 | c9a3779a6 |
14 | 7098d4a61 |
15 | 40d4863c7 |
hex | 26c12c5ed |
10403104237 has 2 divisors, whose sum is σ = 10403104238. Its totient is φ = 10403104236.
The previous prime is 10403104193. The next prime is 10403104247. The reversal of 10403104237 is 73240130401.
10403104237 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8437157316 + 1965946921 = 91854^2 + 44339^2 .
It is a cyclic number.
It is not a de Polignac number, because 10403104237 - 211 = 10403102189 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10403104247) 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, 5201552118 + 5201552119.
It is an arithmetic number, because the mean of its divisors is an integer number (5201552119).
Almost surely, 210403104237 is an apocalyptic number.
It is an amenable number.
10403104237 is a deficient number, since it is larger than the sum of its proper divisors (1).
10403104237 is an equidigital number, since it uses as much as digits as its factorization.
10403104237 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2016, while the sum is 25.
Adding to 10403104237 its reverse (73240130401), we get a palindrome (83643234638).
The spelling of 10403104237 in words is "ten billion, four hundred three million, one hundred four thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •