Base | Representation |
---|---|
bin | 11001011111010011010011… |
… | …110011110011111011010011 |
3 | 112200220212101001201120021011 |
4 | 121133103103303303323103 |
5 | 104143140301200001321 |
6 | 1034231012325311351 |
7 | 32420055006633121 |
oct | 3137232363637323 |
9 | 480825331646234 |
10 | 112102200000211 |
11 | 327a0304446873 |
12 | 106a61a7b65557 |
13 | 4a72266076a25 |
14 | 1d97abdacc911 |
15 | ce607eb46ae1 |
hex | 65f4d3cf3ed3 |
112102200000211 has 4 divisors (see below), whose sum is σ = 112103315423424. Its totient is φ = 112101084577000.
The previous prime is 112102200000209. The next prime is 112102200000251. The reversal of 112102200000211 is 112000002201211.
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 112102200000211 - 21 = 112102200000209 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 112102200000191 and 112102200000200.
It is not an unprimeable number, because it can be changed into a prime (112102200000251) 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, 557560840 + ... + 557761861.
It is an arithmetic number, because the mean of its divisors is an integer number (28025828855856).
Almost surely, 2112102200000211 is an apocalyptic number.
112102200000211 is a deficient number, since it is larger than the sum of its proper divisors (1115423213).
112102200000211 is a wasteful number, since it uses less digits than its factorization.
112102200000211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1115423212.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 112102200000211 its reverse (112000002201211), we get a palindrome (224102202201422).
The spelling of 112102200000211 in words is "one hundred twelve trillion, one hundred two billion, two hundred million, two hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •