Base | Representation |
---|---|
bin | 10111101010011001011000… |
… | …110011100110100101011001 |
3 | 111122110212010000020020210211 |
4 | 113222121120303212211121 |
5 | 102120024341130120343 |
6 | 1005200233011411121 |
7 | 30630463423262236 |
oct | 2752313063464531 |
9 | 448425100206724 |
10 | 104068547504473 |
11 | 30183250006492 |
12 | b809221bb3aa1 |
13 | 460b81148a2c6 |
14 | 1b9ad31cac78d |
15 | c070dd5c679d |
hex | 5ea658ce6959 |
104068547504473 has 8 divisors (see below), whose sum is σ = 110206789376328. Its totient is φ = 97932145922304.
The previous prime is 104068547504437. The next prime is 104068547504489. The reversal of 104068547504473 is 374405745860401.
It can be written as a sum of positive squares in 4 ways, for example, as 148766809 + 104068398737664 = 12197^2 + 10201392^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-104068547504473 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (104068547504573) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 459955986 + ... + 460182187.
It is an arithmetic number, because the mean of its divisors is an integer number (13775848672041).
Almost surely, 2104068547504473 is an apocalyptic number.
It is an amenable number.
104068547504473 is a deficient number, since it is larger than the sum of its proper divisors (6138241871855).
104068547504473 is an equidigital number, since it uses as much as digits as its factorization.
104068547504473 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 920144843.
The product of its (nonzero) digits is 45158400, while the sum is 58.
The spelling of 104068547504473 in words is "one hundred four trillion, sixty-eight billion, five hundred forty-seven million, five hundred four thousand, four hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •