Base | Representation |
---|---|
bin | 1001000110101010010110… |
… | …00000100010110000110001 |
3 | 2121212220101021001010012011 |
4 | 10203111023000202300301 |
5 | 10111002131324001431 |
6 | 110325035112202521 |
7 | 4134255523505056 |
oct | 443251300426061 |
9 | 77786337033164 |
10 | 20020101000241 |
11 | 6419528101031 |
12 | 22b4043399441 |
13 | b22b6c892514 |
14 | 4d2d99b1502d |
15 | 24ab7e902cb1 |
hex | 12354b022c31 |
20020101000241 has 2 divisors, whose sum is σ = 20020101000242. Its totient is φ = 20020101000240.
The previous prime is 20020101000161. The next prime is 20020101000259. The reversal of 20020101000241 is 14200010102002.
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., 19917512113216 + 102588887025 = 4462904^2 + 320295^2 .
It is a cyclic number.
It is not a de Polignac number, because 20020101000241 - 29 = 20020100999729 is a prime.
It is not a weakly prime, because it can be changed into another prime (20020101000541) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10010050500120 + 10010050500121.
It is an arithmetic number, because the mean of its divisors is an integer number (10010050500121).
Almost surely, 220020101000241 is an apocalyptic number.
It is an amenable number.
20020101000241 is a deficient number, since it is larger than the sum of its proper divisors (1).
20020101000241 is an equidigital number, since it uses as much as digits as its factorization.
20020101000241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 20020101000241 its reverse (14200010102002), we get a palindrome (34220111102243).
The spelling of 20020101000241 in words is "twenty trillion, twenty billion, one hundred one million, two hundred forty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.119 sec. • engine limits •