Base | Representation |
---|---|
bin | 1001001001010011110111… |
… | …01000111010010110100101 |
3 | 2122012121021220210101220100 |
4 | 10210221323220322112211 |
5 | 10114000023431432323 |
6 | 110434530020454313 |
7 | 4143660040452633 |
oct | 444517350722645 |
9 | 78177256711810 |
10 | 20111111202213 |
11 | 645408aa83889 |
12 | 230980254a399 |
13 | b2b614a84435 |
14 | 4d7550c58353 |
15 | 24d2097c8943 |
hex | 124a7ba3a5a5 |
20111111202213 has 24 divisors (see below), whose sum is σ = 29556479661696. Its totient is φ = 13174360848000.
The previous prime is 20111111202209. The next prime is 20111111202251. The reversal of 20111111202213 is 31220211111102.
It is a happy number.
It is not a de Polignac number, because 20111111202213 - 22 = 20111111202209 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20111111202113) 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 23 ways as a sum of consecutive naturals, for example, 41343933 + ... + 41827538.
It is an arithmetic number, because the mean of its divisors is an integer number (1231519985904).
Almost surely, 220111111202213 is an apocalyptic number.
It is an amenable number.
20111111202213 is a deficient number, since it is larger than the sum of its proper divisors (9445368459483).
20111111202213 is a wasteful number, since it uses less digits than its factorization.
20111111202213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83171945 (or 83171942 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 18.
Adding to 20111111202213 its reverse (31220211111102), we get a palindrome (51331322313315).
The spelling of 20111111202213 in words is "twenty trillion, one hundred eleven billion, one hundred eleven million, two hundred two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •