Base | Representation |
---|---|
bin | 10100100000110000… |
… | …01111110101100101 |
3 | 1001102110102020020102 |
4 | 22100120033311211 |
5 | 140023111210041 |
6 | 5020421513445 |
7 | 536615145401 |
oct | 122030176545 |
9 | 31373366212 |
10 | 11012210021 |
11 | 474111841a |
12 | 2173b72885 |
13 | 1066611107 |
14 | 76676c101 |
15 | 446ba209b |
hex | 29060fd65 |
11012210021 has 2 divisors, whose sum is σ = 11012210022. Its totient is φ = 11012210020.
The previous prime is 11012209987. The next prime is 11012210039. The reversal of 11012210021 is 12001221011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10218379396 + 793830625 = 101086^2 + 28175^2 .
It is a cyclic number.
It is not a de Polignac number, because 11012210021 - 214 = 11012193637 is a prime.
It is a super-2 number, since 2×110122100212 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11012209984 and 11012210011.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11012210051) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5506105010 + 5506105011.
It is an arithmetic number, because the mean of its divisors is an integer number (5506105011).
Almost surely, 211012210021 is an apocalyptic number.
It is an amenable number.
11012210021 is a deficient number, since it is larger than the sum of its proper divisors (1).
11012210021 is an equidigital number, since it uses as much as digits as its factorization.
11012210021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 11012210021 its reverse (12001221011), we get a palindrome (23013431032).
It can be divided in two parts, 1101 and 2210021, that added together give a palindrome (2211122).
The spelling of 11012210021 in words is "eleven billion, twelve million, two hundred ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •