Base | Representation |
---|---|
bin | 11001100010010110111111… |
… | …100101100011001111101011 |
3 | 112201122221201021111112000111 |
4 | 121202112333211203033223 |
5 | 104210111104403140201 |
6 | 1034511322000115151 |
7 | 32441203562302321 |
oct | 3142267745431753 |
9 | 481587637445014 |
10 | 112312314115051 |
11 | 32871426384166 |
12 | 1071aa66905ab7 |
13 | 4a8900c8c962b |
14 | 1da3d33159d11 |
15 | ceb77aebab51 |
hex | 6625bf9633eb |
112312314115051 has 4 divisors (see below), whose sum is σ = 112312342905192. Its totient is φ = 112312285324912.
The previous prime is 112312314115019. The next prime is 112312314115063. The reversal of 112312314115051 is 150511413213211.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 112312314115051 - 25 = 112312314115019 is a prime.
It is a super-2 number, since 2×1123123141150512 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112312314115081) 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, 7415401 + ... + 16721626.
It is an arithmetic number, because the mean of its divisors is an integer number (28078085726298).
Almost surely, 2112312314115051 is an apocalyptic number.
112312314115051 is a deficient number, since it is larger than the sum of its proper divisors (28790141).
112312314115051 is an equidigital number, since it uses as much as digits as its factorization.
112312314115051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28790140.
The product of its (nonzero) digits is 3600, while the sum is 31.
Adding to 112312314115051 its reverse (150511413213211), we get a palindrome (262823727328262).
The spelling of 112312314115051 in words is "one hundred twelve trillion, three hundred twelve billion, three hundred fourteen million, one hundred fifteen thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •