Base | Representation |
---|---|
bin | 10111101111101010010001… |
… | …011111011001101100111001 |
3 | 111200202102210110202201022021 |
4 | 113233222101133121230321 |
5 | 102141441201043404001 |
6 | 1010034334551354441 |
7 | 30665560404611116 |
oct | 2757522137315471 |
9 | 450672713681267 |
10 | 104430275763001 |
11 | 303026a41a3a81 |
12 | b867354082a21 |
13 | 463696ab07a76 |
14 | 1bb064922390d |
15 | c117100beba1 |
hex | 5efa917d9b39 |
104430275763001 has 2 divisors, whose sum is σ = 104430275763002. Its totient is φ = 104430275763000.
The previous prime is 104430275762999. The next prime is 104430275763097. The reversal of 104430275763001 is 100367572034401.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 64359286835776 + 40070988927225 = 8022424^2 + 6330165^2 .
It is a cyclic number.
It is not a de Polignac number, because 104430275763001 - 21 = 104430275762999 is a prime.
Together with 104430275762999, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (104430275767001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52215137881500 + 52215137881501.
It is an arithmetic number, because the mean of its divisors is an integer number (52215137881501).
Almost surely, 2104430275763001 is an apocalyptic number.
It is an amenable number.
104430275763001 is a deficient number, since it is larger than the sum of its proper divisors (1).
104430275763001 is an equidigital number, since it uses as much as digits as its factorization.
104430275763001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 423360, while the sum is 43.
The spelling of 104430275763001 in words is "one hundred four trillion, four hundred thirty billion, two hundred seventy-five million, seven hundred sixty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •