Base | Representation |
---|---|
bin | 10010101111010111… |
… | …010101111011100001 |
3 | 1220221100002120022210 |
4 | 102233113111323201 |
5 | 312202213013441 |
6 | 13124404152333 |
7 | 1311433121205 |
oct | 225727257341 |
9 | 56840076283 |
10 | 20122001121 |
11 | 85963882a2 |
12 | 3a969986a9 |
13 | 1b88a52651 |
14 | d8c5a2b05 |
15 | 7cb819616 |
hex | 4af5d5ee1 |
20122001121 has 4 divisors (see below), whose sum is σ = 26829334832. Its totient is φ = 13414667412.
The previous prime is 20122001083. The next prime is 20122001183. The reversal of 20122001121 is 12110022102.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 20122001121 - 27 = 20122000993 is a prime.
It is a super-2 number, since 2×201220011212 (a number of 21 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 = 20122001097 and 20122001106.
It is not an unprimeable number, because it can be changed into a prime (20122001021) 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, 3353666851 + ... + 3353666856.
It is an arithmetic number, because the mean of its divisors is an integer number (6707333708).
Almost surely, 220122001121 is an apocalyptic number.
It is an amenable number.
20122001121 is a deficient number, since it is larger than the sum of its proper divisors (6707333711).
20122001121 is an equidigital number, since it uses as much as digits as its factorization.
20122001121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6707333710.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 20122001121 its reverse (12110022102), we get a palindrome (32232023223).
The spelling of 20122001121 in words is "twenty billion, one hundred twenty-two million, one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •