Base | Representation |
---|---|
bin | 11101011010001110001… |
… | …111110010100011010101 |
3 | 21011012121102211001101001 |
4 | 131122032033302203111 |
5 | 231103022402224023 |
6 | 4144235544503301 |
7 | 266004534121111 |
oct | 35321617624325 |
9 | 7135542731331 |
10 | 2021021133013 |
11 | 70a123818193 |
12 | 28782ba7ab31 |
13 | 11877366820c |
14 | 6db64624741 |
15 | 378887016ad |
hex | 1d68e3f28d5 |
2021021133013 has 16 divisors (see below), whose sum is σ = 2105563734000. Its totient is φ = 1937498375680.
The previous prime is 2021021132917. The next prime is 2021021133017. The reversal of 2021021133013 is 3103311201202.
It can be written as a sum of positive squares in 8 ways, for example, as 376453419364 + 1644567713649 = 613558^2 + 1282407^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2021021133013 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2021021133017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3553263 + ... + 4082611.
It is an arithmetic number, because the mean of its divisors is an integer number (131597733375).
Almost surely, 22021021133013 is an apocalyptic number.
It is an amenable number.
2021021133013 is a deficient number, since it is larger than the sum of its proper divisors (84542600987).
2021021133013 is a wasteful number, since it uses less digits than its factorization.
2021021133013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 530312.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 2021021133013 its reverse (3103311201202), we get a palindrome (5124332334215).
The spelling of 2021021133013 in words is "two trillion, twenty-one billion, twenty-one million, one hundred thirty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •