Base | Representation |
---|---|
bin | 11110101110111101100… |
… | …111001010000111100101 |
3 | 21110220110121121112211112 |
4 | 132232331213022013211 |
5 | 234100344041214341 |
6 | 4254124414114405 |
7 | 305405402440646 |
oct | 36567547120745 |
9 | 7426417545745 |
10 | 2112010101221 |
11 | 744775707779 |
12 | 2a13a3aaba05 |
13 | 124214334287 |
14 | 743169db6cd |
15 | 39e117d0aeb |
hex | 1ebbd9ca1e5 |
2112010101221 has 8 divisors (see below), whose sum is σ = 2112886073088. Its totient is φ = 2111134318000.
The previous prime is 2112010101199. The next prime is 2112010101247. The reversal of 2112010101221 is 1221010102112.
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 2112010101221 - 234 = 2094830232037 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2112010101196 and 2112010101205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2112010106221) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 25034891 + ... + 25119111.
It is an arithmetic number, because the mean of its divisors is an integer number (264110759136).
Almost surely, 22112010101221 is an apocalyptic number.
It is an amenable number.
2112010101221 is a deficient number, since it is larger than the sum of its proper divisors (875971867).
2112010101221 is an equidigital number, since it uses as much as digits as its factorization.
2112010101221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94323.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 2112010101221 its reverse (1221010102112), we get a palindrome (3333020203333).
The spelling of 2112010101221 in words is "two trillion, one hundred twelve billion, ten million, one hundred one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •