Base | Representation |
---|---|
bin | 11110100101101111101… |
… | …001010100111001011101 |
3 | 21102221220210210121111100 |
4 | 132211233221110321131 |
5 | 233420111200042341 |
6 | 4245410313543313 |
7 | 304605204065112 |
oct | 36455751247135 |
9 | 7387823717440 |
10 | 2102112112221 |
11 | 740556538080 |
12 | 29b4a1114b39 |
13 | 1232c7812a54 |
14 | 73a58230909 |
15 | 39a328733b6 |
hex | 1e96fa54e5d |
2102112112221 has 12 divisors (see below), whose sum is σ = 3312419086080. Its totient is φ = 1274007340680.
The previous prime is 2102112112181. The next prime is 2102112112231. The reversal of 2102112112221 is 1222112112012.
2102112112221 is a `hidden beast` number, since 21 + 0 + 211 + 211 + 2 + 221 = 666.
It is not a de Polignac number, because 2102112112221 - 211 = 2102112110173 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2102112112194 and 2102112112203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2102112112231) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 10616727741 + ... + 10616727938.
It is an arithmetic number, because the mean of its divisors is an integer number (276034923840).
Almost surely, 22102112112221 is an apocalyptic number.
It is an amenable number.
2102112112221 is a deficient number, since it is larger than the sum of its proper divisors (1210306973859).
2102112112221 is a wasteful number, since it uses less digits than its factorization.
2102112112221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21233455696 (or 21233455693 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 2102112112221 its reverse (1222112112012), we get a palindrome (3324224224233).
The spelling of 2102112112221 in words is "two trillion, one hundred two billion, one hundred twelve million, one hundred twelve thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •