Base | Representation |
---|---|
bin | 11101011010001101000… |
… | …010111111100011111011 |
3 | 21011012120000221020201202 |
4 | 131122031002333203323 |
5 | 231103002224014321 |
6 | 4144233545204415 |
7 | 266004201032603 |
oct | 35321502774373 |
9 | 7135500836652 |
10 | 2021001001211 |
11 | 70a113417935 |
12 | 28782519070b |
13 | 11876c439aca |
14 | 6db61aa3c03 |
15 | 37886a7670b |
hex | 1d68d0bf8fb |
2021001001211 has 8 divisors (see below), whose sum is σ = 2021818590960. Its totient is φ = 2020183548768.
The previous prime is 2021001001177. The next prime is 2021001001219. The reversal of 2021001001211 is 1121001001202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2021001001211 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2021001001192 and 2021001001201.
It is not an unprimeable number, because it can be changed into a prime (2021001001219) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 37207805 + ... + 37262081.
It is an arithmetic number, because the mean of its divisors is an integer number (252727323870).
Almost surely, 22021001001211 is an apocalyptic number.
2021001001211 is a deficient number, since it is larger than the sum of its proper divisors (817589749).
2021001001211 is a wasteful number, since it uses less digits than its factorization.
2021001001211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68653.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 2021001001211 its reverse (1121001001202), we get a palindrome (3142002002413).
Subtracting from 2021001001211 its reverse (1121001001202), we obtain a palindrome (900000000009).
The spelling of 2021001001211 in words is "two trillion, twenty-one billion, one million, one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •