Base | Representation |
---|---|
bin | 10111110000110000111000… |
… | …000100110000010011001001 |
3 | 111201000200110202020211020010 |
4 | 113300300320010300103021 |
5 | 102144211430231014102 |
6 | 1010133233243022133 |
7 | 31004213131622523 |
oct | 2760607004602311 |
9 | 451020422224203 |
10 | 104506085016777 |
11 | 30331866584424 |
12 | b879b9050a949 |
13 | 4640b5c953b92 |
14 | 1bb419b594a13 |
15 | c1369a6dad6c |
hex | 5f0c381304c9 |
104506085016777 has 4 divisors (see below), whose sum is σ = 139341446689040. Its totient is φ = 69670723344516.
The previous prime is 104506085016701. The next prime is 104506085016799. The reversal of 104506085016777 is 777610580605401.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 104506085016777 - 219 = 104506084492489 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (104506085016077) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 17417680836127 + ... + 17417680836132.
It is an arithmetic number, because the mean of its divisors is an integer number (34835361672260).
Almost surely, 2104506085016777 is an apocalyptic number.
It is an amenable number.
104506085016777 is a deficient number, since it is larger than the sum of its proper divisors (34835361672263).
104506085016777 is an equidigital number, since it uses as much as digits as its factorization.
104506085016777 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34835361672262.
The product of its (nonzero) digits is 9878400, while the sum is 57.
The spelling of 104506085016777 in words is "one hundred four trillion, five hundred six billion, eighty-five million, sixteen thousand, seven hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •