Base | Representation |
---|---|
bin | 11100011011101101111100… |
… | …000100111110011011010101 |
3 | 121101202200001022021022210211 |
4 | 130123231330010332123111 |
5 | 112342310002423031401 |
6 | 1121543111343045421 |
7 | 35224365632200321 |
oct | 3433557404763325 |
9 | 541680038238724 |
10 | 125050054502101 |
11 | 36932480799a83 |
12 | 120376562a0871 |
13 | 54a1228634301 |
14 | 22c4652492981 |
15 | e6cc8b3d5951 |
hex | 71bb7c13e6d5 |
125050054502101 has 2 divisors, whose sum is σ = 125050054502102. Its totient is φ = 125050054502100.
The previous prime is 125050054502089. The next prime is 125050054502147. The reversal of 125050054502101 is 101205450050521.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 83893326048900 + 41156728453201 = 9159330^2 + 6415351^2 .
It is a cyclic number.
It is not a de Polignac number, because 125050054502101 - 213 = 125050054493909 is a prime.
It is a super-3 number, since 3×1250500545021013 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (125050054502501) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 62525027251050 + 62525027251051.
It is an arithmetic number, because the mean of its divisors is an integer number (62525027251051).
Almost surely, 2125050054502101 is an apocalyptic number.
It is an amenable number.
125050054502101 is a deficient number, since it is larger than the sum of its proper divisors (1).
125050054502101 is an equidigital number, since it uses as much as digits as its factorization.
125050054502101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 10000, while the sum is 31.
The spelling of 125050054502101 in words is "one hundred twenty-five trillion, fifty billion, fifty-four million, five hundred two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •