Base | Representation |
---|---|
bin | 11001011101111111011111… |
… | …011001000100001011111101 |
3 | 112200121021001210211222000020 |
4 | 121131333133121010023331 |
5 | 104140201441200033201 |
6 | 1034121405545122353 |
7 | 32410420510365504 |
oct | 3135773731041375 |
9 | 480537053758006 |
10 | 112012200002301 |
11 | 3276611a827305 |
12 | 1069086b1893b9 |
13 | 4a669222556b1 |
14 | 1d935c2bd183b |
15 | ce3a637baa36 |
hex | 65dfdf6442fd |
112012200002301 has 4 divisors (see below), whose sum is σ = 149349600003072. Its totient is φ = 74674800001532.
The previous prime is 112012200002249. The next prime is 112012200002309. The reversal of 112012200002301 is 103200002210211.
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 112012200002301 - 26 = 112012200002237 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112012200002309) 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, 18668700000381 + ... + 18668700000386.
It is an arithmetic number, because the mean of its divisors is an integer number (37337400000768).
Almost surely, 2112012200002301 is an apocalyptic number.
It is an amenable number.
112012200002301 is a deficient number, since it is larger than the sum of its proper divisors (37337400000771).
112012200002301 is an equidigital number, since it uses as much as digits as its factorization.
112012200002301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 37337400000770.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 112012200002301 its reverse (103200002210211), we get a palindrome (215212202212512).
The spelling of 112012200002301 in words is "one hundred twelve trillion, twelve billion, two hundred million, two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •