Base | Representation |
---|---|
bin | 11001011101111110011000… |
… | …011110010111110010111001 |
3 | 112200121010222220001022011210 |
4 | 121131332120132113302321 |
5 | 104140142022103223001 |
6 | 1034121051523513333 |
7 | 32410346152336266 |
oct | 3135763036276271 |
9 | 480533886038153 |
10 | 112011010211001 |
11 | 3276566a163510 |
12 | 10690598828849 |
13 | 4a667928c6a85 |
14 | 1d9350cb9c26d |
15 | ce39e40e9dd6 |
hex | 65df98797cb9 |
112011010211001 has 32 divisors (see below), whose sum is σ = 162962000851968. Its totient is φ = 67870089887040.
The previous prime is 112011010210961. The next prime is 112011010211003. The reversal of 112011010211001 is 100112010110211.
It is not a de Polignac number, because 112011010211001 - 26 = 112011010210937 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (112011010211003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3504380046 + ... + 3504412008.
It is an arithmetic number, because the mean of its divisors is an integer number (5092562526624).
Almost surely, 2112011010211001 is an apocalyptic number.
112011010211001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
112011010211001 is a deficient number, since it is larger than the sum of its proper divisors (50950990640967).
112011010211001 is a wasteful number, since it uses less digits than its factorization.
112011010211001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52701.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 112011010211001 its reverse (100112010110211), we get a palindrome (212123020321212).
The spelling of 112011010211001 in words is "one hundred twelve trillion, eleven billion, ten million, two hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •