Base | Representation |
---|---|
bin | 1001001001010011110101… |
… | …11110101001001110010001 |
3 | 2122012121021010221110201010 |
4 | 10210221322332221032101 |
5 | 10114000013112401001 |
6 | 110434524543201133 |
7 | 4143656544334050 |
oct | 444517276511621 |
9 | 78177233843633 |
10 | 20111100122001 |
11 | 64540847a6089 |
12 | 23097ba8a61a9 |
13 | b2b6126a4cb5 |
14 | 4d754d5b2397 |
15 | 24d20883a8d6 |
hex | 124a7afa9391 |
20111100122001 has 32 divisors (see below), whose sum is σ = 30751041484800. Its totient is φ = 11452490743680.
The previous prime is 20111100121963. The next prime is 20111100122051. The reversal of 20111100122001 is 10022100111102.
It is not a de Polignac number, because 20111100122001 - 225 = 20111066567569 is a prime.
It is not an unprimeable number, because it can be changed into a prime (20111100122051) 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, 28445970 + ... + 29144388.
It is an arithmetic number, because the mean of its divisors is an integer number (960970046400).
Almost surely, 220111100122001 is an apocalyptic number.
20111100122001 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
20111100122001 is a deficient number, since it is larger than the sum of its proper divisors (10639941362799).
20111100122001 is a wasteful number, since it uses less digits than its factorization.
20111100122001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 703149.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 20111100122001 its reverse (10022100111102), we get a palindrome (30133200233103).
The spelling of 20111100122001 in words is "twenty trillion, one hundred eleven billion, one hundred million, one hundred twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •