Base | Representation |
---|---|
bin | 10011100100111000… |
… | …111110011010000001 |
3 | 2000020220212011002002 |
4 | 103210320332122001 |
5 | 321022110310423 |
6 | 13353443433345 |
7 | 1342616065214 |
oct | 234470763201 |
9 | 60226764062 |
10 | 21020010113 |
11 | 8a0727a793 |
12 | 40a7685855 |
13 | 1c9cacca0b |
14 | 103596177b |
15 | 8305a1228 |
hex | 4e4e3e681 |
21020010113 has 2 divisors, whose sum is σ = 21020010114. Its totient is φ = 21020010112.
The previous prime is 21020010107. The next prime is 21020010131. The reversal of 21020010113 is 31101002012.
Together with next prime (21020010131) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 20963564944 + 56445169 = 144788^2 + 7513^2 .
It is a cyclic number.
It is not a de Polignac number, because 21020010113 - 212 = 21020006017 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 21020010094 and 21020010103.
It is not a weakly prime, because it can be changed into another prime (21020010103) 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, 10510005056 + 10510005057.
It is an arithmetic number, because the mean of its divisors is an integer number (10510005057).
Almost surely, 221020010113 is an apocalyptic number.
It is an amenable number.
21020010113 is a deficient number, since it is larger than the sum of its proper divisors (1).
21020010113 is an equidigital number, since it uses as much as digits as its factorization.
21020010113 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 21020010113 its reverse (31101002012), we get a palindrome (52121012125).
The spelling of 21020010113 in words is "twenty-one billion, twenty million, ten thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •