Base | Representation |
---|---|
bin | 10000001011101000010… |
… | …111011011111011110011 |
3 | 10221022021012012221210202 |
4 | 100023220113123323303 |
5 | 121204334001121321 |
6 | 2210502403345415 |
7 | 143224253134133 |
oct | 20135027337363 |
9 | 3838235187722 |
10 | 1112000020211 |
11 | 399662026873 |
12 | 15b61a68226b |
13 | 80b26c49052 |
14 | 3bb6d0ccac3 |
15 | 1ddd422770b |
hex | 102e85dbef3 |
1112000020211 has 8 divisors (see below), whose sum is σ = 1112662144080. Its totient is φ = 1111338005728.
The previous prime is 1112000020199. The next prime is 1112000020213. The reversal of 1112000020211 is 1120200002111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1112000020211 - 234 = 1094820151027 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1112000020192 and 1112000020201.
It is not an unprimeable number, because it can be changed into a prime (1112000020213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 29191085 + ... + 29229153.
It is an arithmetic number, because the mean of its divisors is an integer number (139082768010).
Almost surely, 21112000020211 is an apocalyptic number.
1112000020211 is a deficient number, since it is larger than the sum of its proper divisors (662123869).
1112000020211 is a wasteful number, since it uses less digits than its factorization.
1112000020211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54693.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 1112000020211 its reverse (1120200002111), we get a palindrome (2232200022322).
The spelling of 1112000020211 in words is "one trillion, one hundred twelve billion, twenty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •