Base | Representation |
---|---|
bin | 10111110010011011111100… |
… | …101001001100000000111101 |
3 | 111201102200020000000022022211 |
4 | 113302123330221030000331 |
5 | 102203102403311122032 |
6 | 1010302125305340421 |
7 | 31015423125402031 |
oct | 2762337451140075 |
9 | 451380200008284 |
10 | 104621052051517 |
11 | 303765a2466221 |
12 | b898316797711 |
13 | 464b952209aa1 |
14 | 1bb99862d81c1 |
15 | c166788c7747 |
hex | 5f26fca4c03d |
104621052051517 has 2 divisors, whose sum is σ = 104621052051518. Its totient is φ = 104621052051516.
The previous prime is 104621052051511. The next prime is 104621052051577. The reversal of 104621052051517 is 715150250126401.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 104565942611001 + 55109440516 = 10225749^2 + 234754^2 .
It is a cyclic number.
It is not a de Polignac number, because 104621052051517 - 219 = 104621051527229 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 104621052051517.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (104621052051511) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52310526025758 + 52310526025759.
It is an arithmetic number, because the mean of its divisors is an integer number (52310526025759).
Almost surely, 2104621052051517 is an apocalyptic number.
It is an amenable number.
104621052051517 is a deficient number, since it is larger than the sum of its proper divisors (1).
104621052051517 is an equidigital number, since it uses as much as digits as its factorization.
104621052051517 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 84000, while the sum is 40.
The spelling of 104621052051517 in words is "one hundred four trillion, six hundred twenty-one billion, fifty-two million, fifty-one thousand, five hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •