Base | Representation |
---|---|
bin | 10111111001011110101001… |
… | …100011111110010110110101 |
3 | 111210010221100102122212021222 |
4 | 113321132221203332112311 |
5 | 102234020004301332443 |
6 | 1011312322100120125 |
7 | 31065404422565051 |
oct | 2771365143762665 |
9 | 453127312585258 |
10 | 105104989480373 |
11 | 30542859531233 |
12 | b956074396045 |
13 | 468548663429c |
14 | 1bd517413cc61 |
15 | c2404e2a5468 |
hex | 5f97a98fe5b5 |
105104989480373 has 2 divisors, whose sum is σ = 105104989480374. Its totient is φ = 105104989480372.
The previous prime is 105104989480367. The next prime is 105104989480453. The reversal of 105104989480373 is 373084989401501.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 71519800335844 + 33585189144529 = 8456938^2 + 5795273^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-105104989480373 is a prime.
It is a super-2 number, since 2×1051049894803732 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (105104989480303) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52552494740186 + 52552494740187.
It is an arithmetic number, because the mean of its divisors is an integer number (52552494740187).
Almost surely, 2105104989480373 is an apocalyptic number.
It is an amenable number.
105104989480373 is a deficient number, since it is larger than the sum of its proper divisors (1).
105104989480373 is an equidigital number, since it uses as much as digits as its factorization.
105104989480373 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 26127360, while the sum is 62.
The spelling of 105104989480373 in words is "one hundred five trillion, one hundred four billion, nine hundred eighty-nine million, four hundred eighty thousand, three hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •