Base | Representation |
---|---|
bin | 110000000011101010… |
… | …1100010010001111101 |
3 | 100212101100100002110102 |
4 | 1200013111202101331 |
5 | 3142324242113203 |
6 | 115224355250445 |
7 | 10312310041115 |
oct | 1400725422175 |
9 | 325340302412 |
10 | 103202301053 |
11 | 3a84a0102a5 |
12 | 180022a9a25 |
13 | 99690a5737 |
14 | 4dd0488045 |
15 | 2a4043e888 |
hex | 180756247d |
103202301053 has 2 divisors, whose sum is σ = 103202301054. Its totient is φ = 103202301052.
The previous prime is 103202301019. The next prime is 103202301067. The reversal of 103202301053 is 350103202301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 53260331524 + 49941969529 = 230782^2 + 223477^2 .
It is an emirp because it is prime and its reverse (350103202301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 103202301053 - 28 = 103202300797 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103202301953) 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, 51601150526 + 51601150527.
It is an arithmetic number, because the mean of its divisors is an integer number (51601150527).
Almost surely, 2103202301053 is an apocalyptic number.
It is an amenable number.
103202301053 is a deficient number, since it is larger than the sum of its proper divisors (1).
103202301053 is an equidigital number, since it uses as much as digits as its factorization.
103202301053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 540, while the sum is 20.
Adding to 103202301053 its reverse (350103202301), we get a palindrome (453305503354).
The spelling of 103202301053 in words is "one hundred three billion, two hundred two million, three hundred one thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.880 sec. • engine limits •