Base | Representation |
---|---|
bin | 11010101001000100111101… |
… | …111110010101101100101101 |
3 | 120100212112112002221001011121 |
4 | 122221010331332111230231 |
5 | 110324221320343213112 |
6 | 1053112032050220541 |
7 | 33452254305413443 |
oct | 3251047576255455 |
9 | 510775462831147 |
10 | 117172042554157 |
11 | 34375425397898 |
12 | 11184887b84751 |
13 | 504c378a7a496 |
14 | 20d122b1c4b93 |
15 | d82da8c28407 |
hex | 6a913df95b2d |
117172042554157 has 6 divisors (see below), whose sum is σ = 124469955239498. Its totient is φ = 110279569462464.
The previous prime is 117172042554043. The next prime is 117172042554173. The reversal of 117172042554157 is 751455240271711.
It can be written as a sum of positive squares in 3 ways, for example, as 72507762492201 + 44664280061956 = 8515149^2 + 6683134^2 .
It is not a de Polignac number, because 117172042554157 - 27 = 117172042554029 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 (117172042554187) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 202719796518 + ... + 202719797095.
Almost surely, 2117172042554157 is an apocalyptic number.
117172042554157 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
117172042554157 is a deficient number, since it is larger than the sum of its proper divisors (7297912685341).
117172042554157 is an equidigital number, since it uses as much as digits as its factorization.
117172042554157 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 405439593647 (or 405439593630 counting only the distinct ones).
The product of its (nonzero) digits is 2744000, while the sum is 52.
The spelling of 117172042554157 in words is "one hundred seventeen trillion, one hundred seventy-two billion, forty-two million, five hundred fifty-four thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •