Base | Representation |
---|---|
bin | 1001001011111001011111… |
… | …00111100011101101111101 |
3 | 2122112002210211101000211111 |
4 | 10211330233213203231331 |
5 | 10121424130200422112 |
6 | 110543433221122021 |
7 | 4153255401530056 |
oct | 445745747435575 |
9 | 78462724330744 |
10 | 20200030092157 |
11 | 648886a411993 |
12 | 2322a99259311 |
13 | b36b1590ab06 |
14 | 4db98833372d |
15 | 2506b0ca15a7 |
hex | 125f2f9e3b7d |
20200030092157 has 2 divisors, whose sum is σ = 20200030092158. Its totient is φ = 20200030092156.
The previous prime is 20200030092049. The next prime is 20200030092181. The reversal of 20200030092157 is 75129003000202.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 17410749319161 + 2789280772996 = 4172619^2 + 1670114^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20200030092157 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20200030092257) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10100015046078 + 10100015046079.
It is an arithmetic number, because the mean of its divisors is an integer number (10100015046079).
Almost surely, 220200030092157 is an apocalyptic number.
It is an amenable number.
20200030092157 is a deficient number, since it is larger than the sum of its proper divisors (1).
20200030092157 is an equidigital number, since it uses as much as digits as its factorization.
20200030092157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7560, while the sum is 31.
Adding to 20200030092157 its reverse (75129003000202), we get a palindrome (95329033092359).
The spelling of 20200030092157 in words is "twenty trillion, two hundred billion, thirty million, ninety-two thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •