Base | Representation |
---|---|
bin | 10010000111100001010100… |
… | …101101001111010011010101 |
3 | 101110010111021111111000011121 |
4 | 102013201110231033103111 |
5 | 40421001012012430233 |
6 | 441245125142003541 |
7 | 22532544451260013 |
oct | 2207412455172325 |
9 | 343114244430147 |
10 | 79681654420693 |
11 | 23430888695656 |
12 | 8b2aa08a165b1 |
13 | 355cc42337050 |
14 | 15968811898b3 |
15 | 932a818ac92d |
hex | 487854b4f4d5 |
79681654420693 has 16 divisors (see below), whose sum is σ = 85933124363520. Its totient is φ = 73447635635136.
The previous prime is 79681654420661. The next prime is 79681654420703. The reversal of 79681654420693 is 39602445618697.
It is a cyclic number.
It is not a de Polignac number, because 79681654420693 - 25 = 79681654420661 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 (79681654421693) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 334007971 + ... + 334246447.
It is an arithmetic number, because the mean of its divisors is an integer number (5370820272720).
It is a 1-persistent number, because it is pandigital, but 2⋅79681654420693 = 159363308841386 is not.
Almost surely, 279681654420693 is an apocalyptic number.
It is an amenable number.
79681654420693 is a deficient number, since it is larger than the sum of its proper divisors (6251469942827).
79681654420693 is a wasteful number, since it uses less digits than its factorization.
79681654420693 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 274956.
The product of its (nonzero) digits is 470292480, while the sum is 70.
The spelling of 79681654420693 in words is "seventy-nine trillion, six hundred eighty-one billion, six hundred fifty-four million, four hundred twenty thousand, six hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •