Base | Representation |
---|---|
bin | 1100010010110111000… |
… | …0111110101111010111 |
3 | 202012012100222022201021 |
4 | 3010231300332233113 |
5 | 11430040112241434 |
6 | 241011135342011 |
7 | 21155154452101 |
oct | 3045560765727 |
9 | 665170868637 |
10 | 211221212119 |
11 | 8163a95aa25 |
12 | 34b29681907 |
13 | 16bc2019b68 |
14 | a31a4d6571 |
15 | 576365ccb4 |
hex | 312dc3ebd7 |
211221212119 has 8 divisors (see below), whose sum is σ = 222358832640. Its totient is φ = 200085663096.
The previous prime is 211221212113. The next prime is 211221212129. The reversal of 211221212119 is 911212122112.
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 211221212119 - 213 = 211221203927 is a prime.
It is a super-2 number, since 2×2112212121192 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 211221212093 and 211221212102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211221212113) 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, 306349 + ... + 718534.
It is an arithmetic number, because the mean of its divisors is an integer number (27794854080).
Almost surely, 2211221212119 is an apocalyptic number.
211221212119 is a deficient number, since it is larger than the sum of its proper divisors (11137620521).
211221212119 is a wasteful number, since it uses less digits than its factorization.
211221212119 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1035749.
The product of its digits is 288, while the sum is 25.
The spelling of 211221212119 in words is "two hundred eleven billion, two hundred twenty-one million, two hundred twelve thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •