Base | Representation |
---|---|
bin | 1001000110101110010000… |
… | …01000010110111110001101 |
3 | 2121220002210120001120102011 |
4 | 10203113020020112332031 |
5 | 10111020431222413401 |
6 | 110330023301301221 |
7 | 4134361533433150 |
oct | 443271010267615 |
9 | 77802716046364 |
10 | 20022200201101 |
11 | 641a40504377a |
12 | 22b452a404811 |
13 | b231157606c7 |
14 | 4d3118833c97 |
15 | 24ac53d5d451 |
hex | 1235c8216f8d |
20022200201101 has 8 divisors (see below), whose sum is σ = 22883425608384. Its totient is φ = 17161202567040.
The previous prime is 20022200201099. The next prime is 20022200201119. The reversal of 20022200201101 is 10110200222002.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20022200201101 - 21 = 20022200201099 is a prime.
It is a super-2 number, since 2×200222002011012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20022200201161) 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, 56754895 + ... + 57106588.
It is an arithmetic number, because the mean of its divisors is an integer number (2860428201048).
Almost surely, 220022200201101 is an apocalyptic number.
It is an amenable number.
20022200201101 is a deficient number, since it is larger than the sum of its proper divisors (2861225407283).
20022200201101 is a wasteful number, since it uses less digits than its factorization.
20022200201101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 113886611.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 20022200201101 its reverse (10110200222002), we get a palindrome (30132400423103).
The spelling of 20022200201101 in words is "twenty trillion, twenty-two billion, two hundred million, two hundred one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •