Base | Representation |
---|---|
bin | 11010110100000101011000… |
… | …101111100111110010000001 |
3 | 120110112211211101001100021201 |
4 | 122310011120233213302001 |
5 | 110424114333404044433 |
6 | 1054451321202221201 |
7 | 33561021556114336 |
oct | 3264053057476201 |
9 | 513484741040251 |
10 | 117928405924993 |
11 | 346371798371a4 |
12 | 11287394654801 |
13 | 50a57a740b011 |
14 | 2119a9ddb698d |
15 | d978c6138a7d |
hex | 6b4158be7c81 |
117928405924993 has 8 divisors (see below), whose sum is σ = 122574884963328. Its totient is φ = 113358728193264.
The previous prime is 117928405924969. The next prime is 117928405924999. The reversal of 117928405924993 is 399429504829711.
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 117928405924993 - 29 = 117928405924481 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (117928405924999) 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 7 ways as a sum of consecutive naturals, for example, 19200323521 + ... + 19200329662.
It is an arithmetic number, because the mean of its divisors is an integer number (15321860620416).
Almost surely, 2117928405924993 is an apocalyptic number.
It is an amenable number.
117928405924993 is a deficient number, since it is larger than the sum of its proper divisors (4646479038335).
117928405924993 is an equidigital number, since it uses as much as digits as its factorization.
117928405924993 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38400653303.
The product of its (nonzero) digits is 352719360, while the sum is 73.
The spelling of 117928405924993 in words is "one hundred seventeen trillion, nine hundred twenty-eight billion, four hundred five million, nine hundred twenty-four thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •