Base | Representation |
---|---|
bin | 110000000001001111… |
… | …1110110110000010001 |
3 | 100212011200120200100212 |
4 | 1200002133312300101 |
5 | 3142143001322043 |
6 | 115212335253505 |
7 | 10310303026343 |
oct | 1400237666021 |
9 | 325150520325 |
10 | 103121120273 |
11 | 3a808202a46 |
12 | 17b9b07a295 |
13 | 9955320a82 |
14 | 4dc3795293 |
15 | 2a38256018 |
hex | 18027f6c11 |
103121120273 has 2 divisors, whose sum is σ = 103121120274. Its totient is φ = 103121120272.
The previous prime is 103121120237. The next prime is 103121120279. The reversal of 103121120273 is 372021121301.
Together with previous prime (103121120237) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 93934281169 + 9186839104 = 306487^2 + 95848^2 .
It is a cyclic number.
It is not a de Polignac number, because 103121120273 - 214 = 103121103889 is a prime.
It is a super-3 number, since 3×1031211202733 (a number of 34 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (103121120279) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51560560136 + 51560560137.
It is an arithmetic number, because the mean of its divisors is an integer number (51560560137).
Almost surely, 2103121120273 is an apocalyptic number.
It is an amenable number.
103121120273 is a deficient number, since it is larger than the sum of its proper divisors (1).
103121120273 is an equidigital number, since it uses as much as digits as its factorization.
103121120273 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 504, while the sum is 23.
Adding to 103121120273 its reverse (372021121301), we get a palindrome (475142241574).
The spelling of 103121120273 in words is "one hundred three billion, one hundred twenty-one million, one hundred twenty thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •