Base | Representation |
---|---|
bin | 1001001111101110000001… |
… | …00100100011100001000110 |
3 | 2122222122200000121011021001 |
4 | 10213313000210203201012 |
5 | 10131102011110120402 |
6 | 111124024135043514 |
7 | 4165613561152165 |
oct | 447670044434106 |
9 | 78878600534231 |
10 | 20331311020102 |
11 | 6529508042155 |
12 | 2344416b1059a |
13 | b46307ca0674 |
14 | 50407d9973dc |
15 | 253ce62d9187 |
hex | 127dc0923846 |
20331311020102 has 32 divisors (see below), whose sum is σ = 32849225481600. Its totient is φ = 9406482499008.
The previous prime is 20331311020099. The next prime is 20331311020129. The reversal of 20331311020102 is 20102011313302.
It is a super-2 number, since 2×203313110201022 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a self number, because there is not a number n which added to its sum of digits gives 20331311020102.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 156683133 + ... + 156812839.
It is an arithmetic number, because the mean of its divisors is an integer number (1026538296300).
Almost surely, 220331311020102 is an apocalyptic number.
20331311020102 is a deficient number, since it is larger than the sum of its proper divisors (12517914461498).
20331311020102 is a wasteful number, since it uses less digits than its factorization.
20331311020102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 225700.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 20331311020102 its reverse (20102011313302), we get a palindrome (40433322333404).
The spelling of 20331311020102 in words is "twenty trillion, three hundred thirty-one billion, three hundred eleven million, twenty thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •