Base | Representation |
---|---|
bin | 1001001000111111101110… |
… | …11011000001001011110101 |
3 | 2122011120101200022112010202 |
4 | 10210133313123001023311 |
5 | 10113310410034024302 |
6 | 110425541324130245 |
7 | 4143125150521511 |
oct | 444376733011365 |
9 | 78146350275122 |
10 | 20100303033077 |
11 | 644a5440593a3 |
12 | 23076a6996985 |
13 | b2a5b1813997 |
14 | 4d6c07641141 |
15 | 24ccc59cd202 |
hex | 1247f76c12f5 |
20100303033077 has 2 divisors, whose sum is σ = 20100303033078. Its totient is φ = 20100303033076.
The previous prime is 20100303032987. The next prime is 20100303033079. The reversal of 20100303033077 is 77033030300102.
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., 19152579365956 + 947723667121 = 4376366^2 + 973511^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20100303033077 is a prime.
Together with 20100303033079, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20100303033079) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10050151516538 + 10050151516539.
It is an arithmetic number, because the mean of its divisors is an integer number (10050151516539).
Almost surely, 220100303033077 is an apocalyptic number.
It is an amenable number.
20100303033077 is a deficient number, since it is larger than the sum of its proper divisors (1).
20100303033077 is an equidigital number, since it uses as much as digits as its factorization.
20100303033077 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7938, while the sum is 29.
Adding to 20100303033077 its reverse (77033030300102), we get a palindrome (97133333333179).
The spelling of 20100303033077 in words is "twenty trillion, one hundred billion, three hundred three million, thirty-three thousand, seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •