Base | Representation |
---|---|
bin | 11001100111010011011111… |
… | …001100000010001001000101 |
3 | 112202212102212210111012000221 |
4 | 121213103133030002021011 |
5 | 104231143044024310112 |
6 | 1035331403132104341 |
7 | 32504564132600422 |
oct | 3147233714021105 |
9 | 482772783435027 |
10 | 112652146713157 |
11 | 32992563a90a27 |
12 | 107748a80050b1 |
13 | 4ab2089bc7bcc |
14 | 1db6570530d49 |
15 | d0551a5e5e07 |
hex | 6674df302245 |
112652146713157 has 8 divisors (see below), whose sum is σ = 112916194583040. Its totient is φ = 112388219118960.
The previous prime is 112652146713013. The next prime is 112652146713179. The reversal of 112652146713157 is 751317641256211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-112652146713157 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 (112652146710157) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 28193358 + ... + 31940095.
It is an arithmetic number, because the mean of its divisors is an integer number (14114524322880).
Almost surely, 2112652146713157 is an apocalyptic number.
It is an amenable number.
112652146713157 is a deficient number, since it is larger than the sum of its proper divisors (264047869883).
112652146713157 is an equidigital number, since it uses as much as digits as its factorization.
112652146713157 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 60137843.
The product of its digits is 2116800, while the sum is 52.
Adding to 112652146713157 its reverse (751317641256211), we get a palindrome (863969787969368).
The spelling of 112652146713157 in words is "one hundred twelve trillion, six hundred fifty-two billion, one hundred forty-six million, seven hundred thirteen thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •