Base | Representation |
---|---|
bin | 11110110110100111000… |
… | …001101011011110010001 |
3 | 21111200122212002010101121 |
4 | 132312213001223132101 |
5 | 234214203101042314 |
6 | 4302003252402241 |
7 | 306116025045334 |
oct | 36664701533621 |
9 | 7450585063347 |
10 | 2120221112209 |
11 | 7481a95a8872 |
12 | 2a2ab5916381 |
13 | 124c224b8465 |
14 | 7489531261b |
15 | 3a2425acd24 |
hex | 1eda706b791 |
2120221112209 has 8 divisors (see below), whose sum is σ = 2152069416608. Its totient is φ = 2088378784800.
The previous prime is 2120221112189. The next prime is 2120221112213. The reversal of 2120221112209 is 9022111220212.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2120221112209 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2120221112239) 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, 776892 + ... + 2200909.
It is an arithmetic number, because the mean of its divisors is an integer number (269008677076).
Almost surely, 22120221112209 is an apocalyptic number.
It is an amenable number.
2120221112209 is a deficient number, since it is larger than the sum of its proper divisors (31848304399).
2120221112209 is a wasteful number, since it uses less digits than its factorization.
2120221112209 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2988495.
The product of its (nonzero) digits is 576, while the sum is 25.
It can be divided in two parts, 212022 and 1112209, that added together give a palindrome (1324231).
The spelling of 2120221112209 in words is "two trillion, one hundred twenty billion, two hundred twenty-one million, one hundred twelve thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •