Base | Representation |
---|---|
bin | 11110101101000110011… |
… | …001011011000101110110 |
3 | 21110201022020002111020210 |
4 | 132231012121123011312 |
5 | 234032300030341042 |
6 | 4253154125210250 |
7 | 305305005115053 |
oct | 36550631330566 |
9 | 7421266074223 |
10 | 2110010012022 |
11 | 74393970a0a0 |
12 | 2a0b26100986 |
13 | 123c85b58443 |
14 | 741a711c02a |
15 | 39d45e01a9c |
hex | 1eb4665b176 |
2110010012022 has 64 divisors (see below), whose sum is σ = 4616507520000. Its totient is φ = 637614379680.
The previous prime is 2110010012009. The next prime is 2110010012023. The reversal of 2110010012022 is 2202100100112.
It is a junction number, because it is equal to n+sod(n) for n = 2110010011989 and 2110010012007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2110010012023) 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 31 ways as a sum of consecutive naturals, for example, 43020229 + ... + 43069247.
It is an arithmetic number, because the mean of its divisors is an integer number (72132930000).
Almost surely, 22110010012022 is an apocalyptic number.
2110010012022 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
2110010012022 is an abundant number, since it is smaller than the sum of its proper divisors (2506497507978).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2110010012022 is a wasteful number, since it uses less digits than its factorization.
2110010012022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50841.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 2110010012022 its reverse (2202100100112), we get a palindrome (4312110112134).
The spelling of 2110010012022 in words is "two trillion, one hundred ten billion, ten million, twelve thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •