Base | Representation |
---|---|
bin | 1001001011111001100111… |
… | …11010101101010101000001 |
3 | 2122112002222212002120011121 |
4 | 10211330303322231111001 |
5 | 10121424302132033441 |
6 | 110543444315112241 |
7 | 4153260235601434 |
oct | 445746372552501 |
9 | 78462885076147 |
10 | 20200102221121 |
11 | 64888a70a74a9 |
12 | 2322ab9442681 |
13 | b36b27843684 |
14 | 4db993b4b81b |
15 | 2506b729cdd1 |
hex | 125f33ead541 |
20200102221121 has 2 divisors, whose sum is σ = 20200102221122. Its totient is φ = 20200102221120.
The previous prime is 20200102221059. The next prime is 20200102221133. The reversal of 20200102221121 is 12112220100202.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19819769763600 + 380332457521 = 4451940^2 + 616711^2 .
It is a cyclic number.
It is not a de Polignac number, because 20200102221121 - 215 = 20200102188353 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20200102221095 and 20200102221104.
It is not a weakly prime, because it can be changed into another prime (20200102221151) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10100051110560 + 10100051110561.
It is an arithmetic number, because the mean of its divisors is an integer number (10100051110561).
Almost surely, 220200102221121 is an apocalyptic number.
It is an amenable number.
20200102221121 is a deficient number, since it is larger than the sum of its proper divisors (1).
20200102221121 is an equidigital number, since it uses as much as digits as its factorization.
20200102221121 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 16.
Adding to 20200102221121 its reverse (12112220100202), we get a palindrome (32312322321323).
The spelling of 20200102221121 in words is "twenty trillion, two hundred billion, one hundred two million, two hundred twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •