Base | Representation |
---|---|
bin | 11101011010011010110… |
… | …100100100101011001101 |
3 | 21011020011010210101112200 |
4 | 131122122310210223031 |
5 | 231103440404231333 |
6 | 4144312522352113 |
7 | 266013005252241 |
oct | 35323264445315 |
9 | 7136133711480 |
10 | 2021232102093 |
11 | 70a2219123a6 |
12 | 28788a65b639 |
13 | 1187a82931a9 |
14 | 6db84660421 |
15 | 3789bec5c13 |
hex | 1d69ad24acd |
2021232102093 has 12 divisors (see below), whose sum is σ = 2919570030780. Its totient is φ = 1347482275776.
The previous prime is 2021232102091. The next prime is 2021232102101. The reversal of 2021232102093 is 3902012321202.
2021232102093 is a `hidden beast` number, since 20 + 212 + 321 + 0 + 20 + 93 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 1677369487689 + 343862614404 = 1295133^2 + 586398^2 .
It is not a de Polignac number, because 2021232102093 - 21 = 2021232102091 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2021232102091) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3231705 + ... + 3806097.
It is an arithmetic number, because the mean of its divisors is an integer number (243297502565).
Almost surely, 22021232102093 is an apocalyptic number.
It is an amenable number.
2021232102093 is a deficient number, since it is larger than the sum of its proper divisors (898337928687).
2021232102093 is a wasteful number, since it uses less digits than its factorization.
2021232102093 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 965388 (or 965385 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 27.
Adding to 2021232102093 its reverse (3902012321202), we get a palindrome (5923244423295).
The spelling of 2021232102093 in words is "two trillion, twenty-one billion, two hundred thirty-two million, one hundred two thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.085 sec. • engine limits •