Base | Representation |
---|---|
bin | 10110110010011011001101… |
… | …110101011001001110101000 |
3 | 111010212011001211211220010001 |
4 | 112302123031311121032220 |
5 | 101114020101333223422 |
6 | 553053241413032344 |
7 | 30052550021600656 |
oct | 2662331565311650 |
9 | 433764054756101 |
10 | 100222220211112 |
11 | 29a3000658090a |
12 | b2a78a29256b4 |
13 | 43bcbb7ac991c |
14 | 1aa6ad1dd7dd6 |
15 | b8c023870227 |
hex | 5b26cdd593a8 |
100222220211112 has 8 divisors (see below), whose sum is σ = 187916662895850. Its totient is φ = 50111110105552.
The previous prime is 100222220211059. The next prime is 100222220211119. The reversal of 100222220211112 is 211112022222001.
It can be written as a sum of positive squares in only one way, i.e., 78033089645956 + 22189130565156 = 8833634^2 + 4710534^2 .
It is a tau number, because it is divible by the number of its divisors (8).
It is a self number, because there is not a number n which added to its sum of digits gives 100222220211112.
It is not an unprimeable number, because it can be changed into a prime (100222220211119) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6263888763187 + ... + 6263888763202.
Almost surely, 2100222220211112 is an apocalyptic number.
It is an amenable number.
100222220211112 is a deficient number, since it is larger than the sum of its proper divisors (87694442684738).
100222220211112 is a wasteful number, since it uses less digits than its factorization.
100222220211112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12527777526395 (or 12527777526391 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 100222220211112 its reverse (211112022222001), we get a palindrome (311334242433113).
The spelling of 100222220211112 in words is "one hundred trillion, two hundred twenty-two billion, two hundred twenty million, two hundred eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •