Base | Representation |
---|---|
bin | 11010100110110010001000… |
… | …000010000110101100011001 |
3 | 120100022110112201120200022201 |
4 | 122212302020002012230121 |
5 | 110314130413020442210 |
6 | 1052511354323250201 |
7 | 33435003126521533 |
oct | 3246621002065431 |
9 | 510273481520281 |
10 | 117014371265305 |
11 | 343145750258a8 |
12 | 1115a204219961 |
13 | 503a53c0c9167 |
14 | 20c7750a94853 |
15 | d7dc2b92e53a |
hex | 6a6c88086b19 |
117014371265305 has 8 divisors (see below), whose sum is σ = 140526689988672. Its totient is φ = 93538534032048.
The previous prime is 117014371265287. The next prime is 117014371265353. The reversal of 117014371265305 is 503562173410711.
It is a happy number.
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 117014371265305 - 25 = 117014371265273 is a prime.
It is a super-2 number, since 2×1170143712653052 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 9120365469 + ... + 9120378298.
It is an arithmetic number, because the mean of its divisors is an integer number (17565836248584).
Almost surely, 2117014371265305 is an apocalyptic number.
It is an amenable number.
117014371265305 is a deficient number, since it is larger than the sum of its proper divisors (23512318723367).
117014371265305 is a wasteful number, since it uses less digits than its factorization.
117014371265305 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18240745055.
The product of its (nonzero) digits is 529200, while the sum is 46.
The spelling of 117014371265305 in words is "one hundred seventeen trillion, fourteen billion, three hundred seventy-one million, two hundred sixty-five thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •