Base | Representation |
---|---|
bin | 1001001100100010100111… |
… | …10011010110100001101111 |
3 | 2122121012210202101011220020 |
4 | 10212101103303112201233 |
5 | 10122304341133000421 |
6 | 111001524321053223 |
7 | 4154666533616340 |
oct | 446212363264157 |
9 | 78535722334806 |
10 | 20222112000111 |
11 | 649717104219a |
12 | 2327220487213 |
13 | b38c2470a738 |
14 | 4dca80d160c7 |
15 | 2510546addc6 |
hex | 126453cd686f |
20222112000111 has 16 divisors (see below), whose sum is σ = 30824641976064. Its totient is φ = 11551744401984.
The previous prime is 20222112000089. The next prime is 20222112000151. The reversal of 20222112000111 is 11100021122202.
It is not a de Polignac number, because 20222112000111 - 211 = 20222111998063 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20222112000151) 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 15 ways as a sum of consecutive naturals, for example, 156107446 + ... + 156236931.
It is an arithmetic number, because the mean of its divisors is an integer number (1926540123504).
Almost surely, 220222112000111 is an apocalyptic number.
20222112000111 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
20222112000111 is a deficient number, since it is larger than the sum of its proper divisors (10602529975953).
20222112000111 is a wasteful number, since it uses less digits than its factorization.
20222112000111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 312347470.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 20222112000111 its reverse (11100021122202), we get a palindrome (31322133122313).
The spelling of 20222112000111 in words is "twenty trillion, two hundred twenty-two billion, one hundred twelve million, one hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •