Base | Representation |
---|---|
bin | 10111101110011101001010… |
… | …000110000000101000011001 |
3 | 111200110112001211210020220022 |
4 | 113232131022012000220121 |
5 | 102134112111211431003 |
6 | 1005532322332440225 |
7 | 30656566445434664 |
oct | 2756351206005031 |
9 | 450415054706808 |
10 | 104347473545753 |
11 | 30280573535679 |
12 | b8532a5919075 |
13 | 462bc0327a749 |
14 | 1baa6322486db |
15 | c0e4b5ac9738 |
hex | 5ee74a180a19 |
104347473545753 has 8 divisors (see below), whose sum is σ = 107953082181000. Its totient is φ = 100742359570048.
The previous prime is 104347473545741. The next prime is 104347473545761. The reversal of 104347473545753 is 357545374743401.
It can be written as a sum of positive squares in 4 ways, for example, as 36371851304464 + 67975622241289 = 6030908^2 + 8244733^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 104347473545753 - 222 = 104347469351449 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (104347473595753) 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, 123235676 + ... + 124079517.
It is an arithmetic number, because the mean of its divisors is an integer number (13494135272625).
Almost surely, 2104347473545753 is an apocalyptic number.
It is an amenable number.
104347473545753 is a deficient number, since it is larger than the sum of its proper divisors (3605608635247).
104347473545753 is a wasteful number, since it uses less digits than its factorization.
104347473545753 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 247329771.
The product of its (nonzero) digits is 296352000, while the sum is 62.
The spelling of 104347473545753 in words is "one hundred four trillion, three hundred forty-seven billion, four hundred seventy-three million, five hundred forty-five thousand, seven hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •