Base | Representation |
---|---|
bin | 10111110100010110000001… |
… | …001101111000001101001101 |
3 | 111201220012112201102021011111 |
4 | 113310112001031320031031 |
5 | 102212224323032443401 |
6 | 1010442243443452021 |
7 | 31031043213434434 |
oct | 2764260115701515 |
9 | 451805481367144 |
10 | 104752125281101 |
11 | 30417143925651 |
12 | b8b97b6987011 |
13 | 465b11054b2bc |
14 | 1bc205c13411b |
15 | c19c9aa84e51 |
hex | 5f458137834d |
104752125281101 has 2 divisors, whose sum is σ = 104752125281102. Its totient is φ = 104752125281100.
The previous prime is 104752125281051. The next prime is 104752125281147. The reversal of 104752125281101 is 101182521257401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 62271842345001 + 42480282936100 = 7891251^2 + 6517690^2 .
It is a cyclic number.
It is not a de Polignac number, because 104752125281101 - 231 = 104749977797453 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (104752125281501) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52376062640550 + 52376062640551.
It is an arithmetic number, because the mean of its divisors is an integer number (52376062640551).
Almost surely, 2104752125281101 is an apocalyptic number.
It is an amenable number.
104752125281101 is a deficient number, since it is larger than the sum of its proper divisors (1).
104752125281101 is an equidigital number, since it uses as much as digits as its factorization.
104752125281101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 44800, while the sum is 40.
The spelling of 104752125281101 in words is "one hundred four trillion, seven hundred fifty-two billion, one hundred twenty-five million, two hundred eighty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •