Base | Representation |
---|---|
bin | 11110110110100001001… |
… | …000011001111100011001 |
3 | 21111200101221222110222101 |
4 | 132312201020121330121 |
5 | 234214002241241441 |
6 | 4301545400523401 |
7 | 306113414314024 |
oct | 36664110317431 |
9 | 7450357873871 |
10 | 2120122212121 |
11 | 748158798761 |
12 | 2a2a88780561 |
13 | 124c07b6b4b4 |
14 | 7488612a1bb |
15 | 3a238a74231 |
hex | 1eda1219f19 |
2120122212121 has 4 divisors (see below), whose sum is σ = 2143943810100. Its totient is φ = 2096300614144.
The previous prime is 2120122212097. The next prime is 2120122212127. The reversal of 2120122212121 is 1212122210212.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 157657437721 + 1962464774400 = 397061^2 + 1400880^2 .
It is a cyclic number.
It is not a de Polignac number, because 2120122212121 - 27 = 2120122211993 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2120122212127) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11910798856 + ... + 11910799033.
It is an arithmetic number, because the mean of its divisors is an integer number (535985952525).
Almost surely, 22120122212121 is an apocalyptic number.
It is an amenable number.
2120122212121 is a deficient number, since it is larger than the sum of its proper divisors (23821597979).
2120122212121 is an equidigital number, since it uses as much as digits as its factorization.
2120122212121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23821597978.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 2120122212121 its reverse (1212122210212), we get a palindrome (3332244422333).
The spelling of 2120122212121 in words is "two trillion, one hundred twenty billion, one hundred twenty-two million, two hundred twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •