Base | Representation |
---|---|
bin | 11101011010010011000… |
… | …000011101011000010011 |
3 | 21011012211000002201120102 |
4 | 131122103000131120103 |
5 | 231103203324001321 |
6 | 4144251520403015 |
7 | 266006524022066 |
oct | 35322300353023 |
9 | 7135730081512 |
10 | 2021101000211 |
11 | 70a164908637 |
12 | 28785277646b |
13 | 118787080007 |
14 | 6db710948dd |
15 | 3789072ac0b |
hex | 1d69301d613 |
2021101000211 has 4 divisors (see below), whose sum is σ = 2022564507024. Its totient is φ = 2019637493400.
The previous prime is 2021101000187. The next prime is 2021101000253. The reversal of 2021101000211 is 1120001011202.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2021101000211 - 226 = 2021033891347 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2021101000192 and 2021101000201.
It is not an unprimeable number, because it can be changed into a prime (2021101600211) 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 in 3 ways as a sum of consecutive naturals, for example, 731751335 + ... + 731754096.
It is an arithmetic number, because the mean of its divisors is an integer number (505641126756).
Almost surely, 22021101000211 is an apocalyptic number.
2021101000211 is a deficient number, since it is larger than the sum of its proper divisors (1463506813).
2021101000211 is a wasteful number, since it uses less digits than its factorization.
2021101000211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1463506812.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 2021101000211 its reverse (1120001011202), we get a palindrome (3141102011413).
The spelling of 2021101000211 in words is "two trillion, twenty-one billion, one hundred one million, two hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •