Base | Representation |
---|---|
bin | 10111110010110100110110… |
… | …110110111111111111111111 |
3 | 111201112020021000021102222222 |
4 | 113302310312312333333333 |
5 | 102204022142412221443 |
6 | 1010322311315555555 |
7 | 31020361001050142 |
oct | 2762646666777777 |
9 | 451466230242888 |
10 | 104647798554623 |
11 | 30386978137945 |
12 | b8a153bbbbbbb |
13 | 465132552239c |
14 | 1bbada25d0059 |
15 | c171e1a87468 |
hex | 5f2d36dbffff |
104647798554623 has 4 divisors (see below), whose sum is σ = 104674762691088. Its totient is φ = 104620834418160.
The previous prime is 104647798554583. The next prime is 104647798554659. The reversal of 104647798554623 is 326455897746401.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 104647798554623 - 28 = 104647798554367 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104647798854623) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13482062411 + ... + 13482070172.
It is an arithmetic number, because the mean of its divisors is an integer number (26168690672772).
It is a 1-persistent number, because it is pandigital, but 2⋅104647798554623 = 209295597109246 is not.
Almost surely, 2104647798554623 is an apocalyptic number.
104647798554623 is a deficient number, since it is larger than the sum of its proper divisors (26964136465).
104647798554623 is an equidigital number, since it uses as much as digits as its factorization.
104647798554623 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26964136464.
The product of its (nonzero) digits is 1219276800, while the sum is 71.
The spelling of 104647798554623 in words is "one hundred four trillion, six hundred forty-seven billion, seven hundred ninety-eight million, five hundred fifty-four thousand, six hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •