Base | Representation |
---|---|
bin | 10010111010001101… |
… | …110100011101010101 |
3 | 1221102000122211001202 |
4 | 102322031310131111 |
5 | 313040314212401 |
6 | 13154430202245 |
7 | 1316103420002 |
oct | 227215643525 |
9 | 57360584052 |
10 | 20304054101 |
11 | 867a122401 |
12 | 3b27953385 |
13 | 1bb7694ac6 |
14 | da88328a9 |
15 | 7dc7cb06b |
hex | 4ba374755 |
20304054101 has 2 divisors, whose sum is σ = 20304054102. Its totient is φ = 20304054100.
The previous prime is 20304054083. The next prime is 20304054131. The reversal of 20304054101 is 10145040302.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 14355634225 + 5948419876 = 119815^2 + 77126^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20304054101 is a prime.
It is a super-3 number, since 3×203040541013 (a number of 32 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20304054131) 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, 10152027050 + 10152027051.
It is an arithmetic number, because the mean of its divisors is an integer number (10152027051).
Almost surely, 220304054101 is an apocalyptic number.
It is an amenable number.
20304054101 is a deficient number, since it is larger than the sum of its proper divisors (1).
20304054101 is an equidigital number, since it uses as much as digits as its factorization.
20304054101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 480, while the sum is 20.
Adding to 20304054101 its reverse (10145040302), we get a palindrome (30449094403).
The spelling of 20304054101 in words is "twenty billion, three hundred four million, fifty-four thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •