Base | Representation |
---|---|
bin | 111101100001001… |
… | …010010011100101 |
3 | 2122221002021100021 |
4 | 331201022103211 |
5 | 4103204300031 |
6 | 250225315141 |
7 | 34401506026 |
oct | 7541122345 |
9 | 2587067307 |
10 | 1032103141 |
11 | 48a660403 |
12 | 249795ab1 |
13 | 135a9a524 |
14 | 9b106c4d |
15 | 60923511 |
hex | 3d84a4e5 |
1032103141 has 2 divisors, whose sum is σ = 1032103142. Its totient is φ = 1032103140.
The previous prime is 1032103129. The next prime is 1032103169. The reversal of 1032103141 is 1413012301.
1032103141 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 630261025 + 401842116 = 25105^2 + 20046^2 .
It is an emirp because it is prime and its reverse (1413012301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1032103141 - 25 = 1032103109 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1032103441) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 516051570 + 516051571.
It is an arithmetic number, because the mean of its divisors is an integer number (516051571).
Almost surely, 21032103141 is an apocalyptic number.
It is an amenable number.
1032103141 is a deficient number, since it is larger than the sum of its proper divisors (1).
1032103141 is an equidigital number, since it uses as much as digits as its factorization.
1032103141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 16.
The square root of 1032103141 is about 32126.3620878555. The cubic root of 1032103141 is about 1010.5885342245.
Adding to 1032103141 its reverse (1413012301), we get a palindrome (2445115442).
The spelling of 1032103141 in words is "one billion, thirty-two million, one hundred three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •