Base | Representation |
---|---|
bin | 111010100001110010100… |
… | …011001000001001111001 |
3 | 112020111111212122112002021 |
4 | 322201302203020021321 |
5 | 1011344034331400441 |
6 | 12315404134234441 |
7 | 563403121060165 |
oct | 72416243101171 |
9 | 15214455575067 |
10 | 4022011200121 |
11 | 13107a8518052 |
12 | 54b5ab4b5a21 |
13 | 23237406c5c5 |
14 | dc948797ca5 |
15 | 6e94d59c3d1 |
hex | 3a8728c8279 |
4022011200121 has 2 divisors, whose sum is σ = 4022011200122. Its totient is φ = 4022011200120.
The previous prime is 4022011200089. The next prime is 4022011200217. The reversal of 4022011200121 is 1210021102204.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4012009000000 + 10002200121 = 2003000^2 + 100011^2 .
It is a cyclic number.
It is not a de Polignac number, because 4022011200121 - 25 = 4022011200089 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4022011200095 and 4022011200104.
It is not a weakly prime, because it can be changed into another prime (4022011200721) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2011005600060 + 2011005600061.
It is an arithmetic number, because the mean of its divisors is an integer number (2011005600061).
Almost surely, 24022011200121 is an apocalyptic number.
It is an amenable number.
4022011200121 is a deficient number, since it is larger than the sum of its proper divisors (1).
4022011200121 is an equidigital number, since it uses as much as digits as its factorization.
4022011200121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 4022011200121 its reverse (1210021102204), we get a palindrome (5232032302325).
The spelling of 4022011200121 in words is "four trillion, twenty-two billion, eleven million, two hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •