Base | Representation |
---|---|
bin | 11110100101101010010… |
… | …001100101000111001101 |
3 | 21102221200112020111021110 |
4 | 132211222101211013031 |
5 | 233414420113013401 |
6 | 4245353334322233 |
7 | 304603031130351 |
oct | 36455221450715 |
9 | 7387615214243 |
10 | 2102022001101 |
11 | 74050a690280 |
12 | 29b476ab9379 |
13 | 1232b1c52369 |
14 | 73a4a295461 |
15 | 39a299c39d6 |
hex | 1e96a4651cd |
2102022001101 has 32 divisors (see below), whose sum is σ = 3103747992576. Its totient is φ = 1254684816000.
The previous prime is 2102022001099. The next prime is 2102022001103. The reversal of 2102022001101 is 1011002202012.
It is an interprime number because it is at equal distance from previous prime (2102022001099) and next prime (2102022001103).
It is not a de Polignac number, because 2102022001101 - 21 = 2102022001099 is a prime.
It is a super-3 number, since 3×21020220011013 (a number of 38 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2102022001103) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 11140536 + ... + 11327646.
It is an arithmetic number, because the mean of its divisors is an integer number (96992124768).
Almost surely, 22102022001101 is an apocalyptic number.
It is an amenable number.
2102022001101 is a deficient number, since it is larger than the sum of its proper divisors (1001725991475).
2102022001101 is a wasteful number, since it uses less digits than its factorization.
2102022001101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 192273.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 2102022001101 its reverse (1011002202012), we get a palindrome (3113024203113).
The spelling of 2102022001101 in words is "two trillion, one hundred two billion, twenty-two million, one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •