Base | Representation |
---|---|
bin | 110100011100000011… |
… | …0110010011000111101 |
3 | 101202200000102201202111 |
4 | 1220320012302120331 |
5 | 3321111233444203 |
6 | 123422120454021 |
7 | 11064410025520 |
oct | 1507006623075 |
9 | 352600381674 |
10 | 112610453053 |
11 | 4383773512a |
12 | 199a901a311 |
13 | a80828c997 |
14 | 5643b86bb7 |
15 | 2de139026d |
hex | 1a381b263d |
112610453053 has 4 divisors (see below), whose sum is σ = 128697660640. Its totient is φ = 96523245468.
The previous prime is 112610453041. The next prime is 112610453071. The reversal of 112610453053 is 350354016211.
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.
It is a cyclic number.
It is not a de Polignac number, because 112610453053 - 217 = 112610321981 is a prime.
It is a super-2 number, since 2×1126104530532 (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 (112610453003) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8043603783 + ... + 8043603796.
It is an arithmetic number, because the mean of its divisors is an integer number (32174415160).
Almost surely, 2112610453053 is an apocalyptic number.
It is an amenable number.
112610453053 is a deficient number, since it is larger than the sum of its proper divisors (16087207587).
112610453053 is an equidigital number, since it uses as much as digits as its factorization.
112610453053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16087207586.
The product of its (nonzero) digits is 10800, while the sum is 31.
Adding to 112610453053 its reverse (350354016211), we get a palindrome (462964469264).
The spelling of 112610453053 in words is "one hundred twelve billion, six hundred ten million, four hundred fifty-three thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •