Base | Representation |
---|---|
bin | 110110101001001001… |
… | …1110110100000011101 |
3 | 102012212222102022111000 |
4 | 1231102103312200131 |
5 | 3410310313141301 |
6 | 125524011420513 |
7 | 11322630330162 |
oct | 1552223664035 |
9 | 365788368430 |
10 | 117345052701 |
11 | 4584724a9a8 |
12 | 1a8aa754739 |
13 | b0b1146236 |
14 | 59728c0069 |
15 | 30bbd6e786 |
hex | 1b524f681d |
117345052701 has 8 divisors (see below), whose sum is σ = 173844522560. Its totient is φ = 78230035116.
The previous prime is 117345052697. The next prime is 117345052717. The reversal of 117345052701 is 107250543711.
117345052701 is a `hidden beast` number, since 11 + 73 + 4 + 50 + 527 + 0 + 1 = 666.
It is not a de Polignac number, because 117345052701 - 22 = 117345052697 is a prime.
It is a super-2 number, since 2×1173450527012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (117345052751) 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 7 ways as a sum of consecutive naturals, for example, 2173056505 + ... + 2173056558.
It is an arithmetic number, because the mean of its divisors is an integer number (21730565320).
Almost surely, 2117345052701 is an apocalyptic number.
It is an amenable number.
117345052701 is a deficient number, since it is larger than the sum of its proper divisors (56499469859).
117345052701 is an equidigital number, since it uses as much as digits as its factorization.
117345052701 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4346113072 (or 4346113066 counting only the distinct ones).
The product of its (nonzero) digits is 29400, while the sum is 36.
The spelling of 117345052701 in words is "one hundred seventeen billion, three hundred forty-five million, fifty-two thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •