Base | Representation |
---|---|
bin | 1001001100011110111000… |
… | …11111001000110000011001 |
3 | 2122121000122020122211000022 |
4 | 10212033130133020300121 |
5 | 10122241241203241441 |
6 | 111000553531520225 |
7 | 4154566115656631 |
oct | 446173437106031 |
9 | 78530566584008 |
10 | 20220110212121 |
11 | 6496334094256 |
12 | 2326961bb9075 |
13 | b38995a885c1 |
14 | 4dc9311136c1 |
15 | 250e88a9684b |
hex | 1263dc7c8c19 |
20220110212121 has 2 divisors, whose sum is σ = 20220110212122. Its totient is φ = 20220110212120.
The previous prime is 20220110212061. The next prime is 20220110212139. The reversal of 20220110212121 is 12121201102202.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 20186644632025 + 33465580096 = 4492955^2 + 182936^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20220110212121 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 20220110212121.
It is not a weakly prime, because it can be changed into another prime (20220110202121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10110055106060 + 10110055106061.
It is an arithmetic number, because the mean of its divisors is an integer number (10110055106061).
Almost surely, 220220110212121 is an apocalyptic number.
It is an amenable number.
20220110212121 is a deficient number, since it is larger than the sum of its proper divisors (1).
20220110212121 is an equidigital number, since it uses as much as digits as its factorization.
20220110212121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 20220110212121 its reverse (12121201102202), we get a palindrome (32341311314323).
The spelling of 20220110212121 in words is "twenty trillion, two hundred twenty billion, one hundred ten million, two hundred twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •