Base | Representation |
---|---|
bin | 110110100011011011… |
… | …1011101010100111101 |
3 | 102012101121011002020001 |
4 | 1231012313131110331 |
5 | 3404412140411112 |
6 | 125452552354301 |
7 | 11315106403150 |
oct | 1550667352475 |
9 | 365347132201 |
10 | 117153060157 |
11 | 45758937081 |
12 | 1a8563a5991 |
13 | b080433893 |
14 | 59551c3c97 |
15 | 30aa097c57 |
hex | 1b46ddd53d |
117153060157 has 4 divisors (see below), whose sum is σ = 133889211616. Its totient is φ = 100416908700.
The previous prime is 117153060149. The next prime is 117153060173. The reversal of 117153060157 is 751060351711.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 751060351711 = 31 ⋅24227753281.
It is a cyclic number.
It is not a de Polignac number, because 117153060157 - 23 = 117153060149 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 (117153060197) 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 3 ways as a sum of consecutive naturals, for example, 8368075719 + ... + 8368075732.
It is an arithmetic number, because the mean of its divisors is an integer number (33472302904).
Almost surely, 2117153060157 is an apocalyptic number.
It is an amenable number.
117153060157 is a deficient number, since it is larger than the sum of its proper divisors (16736151459).
117153060157 is an equidigital number, since it uses as much as digits as its factorization.
117153060157 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16736151458.
The product of its (nonzero) digits is 22050, while the sum is 37.
The spelling of 117153060157 in words is "one hundred seventeen billion, one hundred fifty-three million, sixty thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •