Base | Representation |
---|---|
bin | 10011000001001111… |
… | …11100110011110101 |
3 | 222100121211120011201 |
4 | 21200213330303311 |
5 | 131403010120041 |
6 | 4405121332501 |
7 | 511016144446 |
oct | 114047746365 |
9 | 28317746151 |
10 | 10211020021 |
11 | 436a944524 |
12 | 1b8b797131 |
13 | c696326a7 |
14 | 6cc1b32cd |
15 | 3eb692631 |
hex | 2609fccf5 |
10211020021 has 2 divisors, whose sum is σ = 10211020022. Its totient is φ = 10211020020.
The previous prime is 10211020019. The next prime is 10211020049. The reversal of 10211020021 is 12002011201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8688849796 + 1522170225 = 93214^2 + 39015^2 .
It is a cyclic number.
It is not a de Polignac number, because 10211020021 - 21 = 10211020019 is a prime.
Together with 10211020019, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10211120021) 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, 5105510010 + 5105510011.
It is an arithmetic number, because the mean of its divisors is an integer number (5105510011).
Almost surely, 210211020021 is an apocalyptic number.
It is an amenable number.
10211020021 is a deficient number, since it is larger than the sum of its proper divisors (1).
10211020021 is an equidigital number, since it uses as much as digits as its factorization.
10211020021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 10211020021 its reverse (12002011201), we get a palindrome (22213031222).
The spelling of 10211020021 in words is "ten billion, two hundred eleven million, twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •