Base | Representation |
---|---|
bin | 11001101110001000010101… |
… | …110011110011110101100011 |
3 | 112211112021121221100221221002 |
4 | 121232020111303303311203 |
5 | 104311334221410422001 |
6 | 1040331100223422215 |
7 | 32553511102434413 |
oct | 3156102563636543 |
9 | 484467557327832 |
10 | 113121214545251 |
11 | 3305348a6018a0 |
12 | 1082b795a5496b |
13 | 4b17391803543 |
14 | 1dd114b5b8643 |
15 | d1282086c46b |
hex | 66e215cf3d63 |
113121214545251 has 8 divisors (see below), whose sum is σ = 126274844144064. Its totient is φ = 100445898750120.
The previous prime is 113121214545161. The next prime is 113121214545253. The reversal of 113121214545251 is 152545412121311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 113121214545251 - 234 = 113104034676067 is a prime.
It is not an unprimeable number, because it can be changed into a prime (113121214545253) 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, 119578450421 + ... + 119578451366.
It is an arithmetic number, because the mean of its divisors is an integer number (15784355518008).
Almost surely, 2113121214545251 is an apocalyptic number.
113121214545251 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
113121214545251 is a deficient number, since it is larger than the sum of its proper divisors (13153629598813).
113121214545251 is a wasteful number, since it uses less digits than its factorization.
113121214545251 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 239156901841.
The product of its digits is 48000, while the sum is 38.
Adding to 113121214545251 its reverse (152545412121311), we get a palindrome (265666626666562).
The spelling of 113121214545251 in words is "one hundred thirteen trillion, one hundred twenty-one billion, two hundred fourteen million, five hundred forty-five thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.383 sec. • engine limits •