Base | Representation |
---|---|
bin | 11010100110111101011001… |
… | …010111111100100010010001 |
3 | 120100100121210010210222012112 |
4 | 122212331121113330202101 |
5 | 110314330204140113401 |
6 | 1052521115241235105 |
7 | 33435612050620124 |
oct | 3246753127744221 |
9 | 510317703728175 |
10 | 117026473363601 |
11 | 3431971538142a |
12 | 11160621192a95 |
13 | 503b71a45a579 |
14 | 20c817c08c3bb |
15 | d7e1d911b3bb |
hex | 6a6f595fc891 |
117026473363601 has 16 divisors (see below), whose sum is σ = 120011503564800. Its totient is φ = 114062936094288.
The previous prime is 117026473363571. The next prime is 117026473363609. The reversal of 117026473363601 is 106363374620711.
It is a cyclic number.
It is not a de Polignac number, because 117026473363601 - 218 = 117026473101457 is a prime.
It is a super-2 number, since 2×1170264733636012 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 117026473363601.
It is not an unprimeable number, because it can be changed into a prime (117026473363609) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7776506 + ... + 17161788.
It is an arithmetic number, because the mean of its divisors is an integer number (7500718972800).
Almost surely, 2117026473363601 is an apocalyptic number.
It is an amenable number.
117026473363601 is a deficient number, since it is larger than the sum of its proper divisors (2985030201199).
117026473363601 is an equidigital number, since it uses as much as digits as its factorization.
117026473363601 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9386428.
The product of its (nonzero) digits is 2286144, while the sum is 50.
The spelling of 117026473363601 in words is "one hundred seventeen trillion, twenty-six billion, four hundred seventy-three million, three hundred sixty-three thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •