Base | Representation |
---|---|
bin | 1001001001010010000001… |
… | …01100010010110101110000 |
3 | 2122012111201222212120110101 |
4 | 10210221000230102311300 |
5 | 10113441012242430300 |
6 | 110434243531442144 |
7 | 4143623401404226 |
oct | 444510054226560 |
9 | 78174658776411 |
10 | 20110122233200 |
11 | 645372280481a |
12 | 23095872b6354 |
13 | b2b4b7c0a17c |
14 | 4d749977cb16 |
15 | 24d19ca75b6a |
hex | 124a40b12d70 |
20110122233200 has 120 divisors (see below), whose sum is σ = 50447699689680. Its totient is φ = 7694081740800.
The previous prime is 20110122233119. The next prime is 20110122233263. The reversal of 20110122233200 is 233222101102.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 6859881 + ... + 9342280.
It is an arithmetic number, because the mean of its divisors is an integer number (420397497414).
Almost surely, 220110122233200 is an apocalyptic number.
20110122233200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20110122233200 is an abundant number, since it is smaller than the sum of its proper divisors (30337577456480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20110122233200 is a wasteful number, since it uses less digits than its factorization.
20110122233200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16202315 (or 16202304 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 20110122233200 its reverse (233222101102), we get a palindrome (20343344334302).
The spelling of 20110122233200 in words is "twenty trillion, one hundred ten billion, one hundred twenty-two million, two hundred thirty-three thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •