Base | Representation |
---|---|
bin | 10010101001010110… |
… | …011111000010101001 |
3 | 1220200022020220211202 |
4 | 102221112133002221 |
5 | 312000401104001 |
6 | 13110401533545 |
7 | 1306066436561 |
oct | 225126370251 |
9 | 56608226752 |
10 | 20021113001 |
11 | 854443a58a |
12 | 3a690442b5 |
13 | 1b70b8a836 |
14 | d7d01dda1 |
15 | 7c2a3b96b |
hex | 4a959f0a9 |
20021113001 has 2 divisors, whose sum is σ = 20021113002. Its totient is φ = 20021113000.
The previous prime is 20021112977. The next prime is 20021113037. The reversal of 20021113001 is 10031112002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10961880601 + 9059232400 = 104699^2 + 95180^2 .
It is a cyclic number.
It is not a de Polignac number, because 20021113001 - 222 = 20016918697 is a prime.
It is a super-2 number, since 2×200211130012 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (20021113051) 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, 10010556500 + 10010556501.
It is an arithmetic number, because the mean of its divisors is an integer number (10010556501).
Almost surely, 220021113001 is an apocalyptic number.
It is an amenable number.
20021113001 is a deficient number, since it is larger than the sum of its proper divisors (1).
20021113001 is an equidigital number, since it uses as much as digits as its factorization.
20021113001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 20021113001 its reverse (10031112002), we get a palindrome (30052225003).
Subtracting from 20021113001 its reverse (10031112002), we obtain a palindrome (9990000999).
The spelling of 20021113001 in words is "twenty billion, twenty-one million, one hundred thirteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •