Base | Representation |
---|---|
bin | 1001000110000100111100… |
… | …01010101100000101001110 |
3 | 2121210222112212121022002000 |
4 | 10203002132022230011032 |
5 | 10110140020430113202 |
6 | 110311514415213130 |
7 | 4132645113240114 |
oct | 443023612540516 |
9 | 77728485538060 |
10 | 20000021332302 |
11 | 6410a63708340 |
12 | 22b017a8171a6 |
13 | b20cbc8426bb |
14 | 4d2013011ab4 |
15 | 24a3a6b9b91c |
hex | 12309e2ac14e |
20000021332302 has 64 divisors (see below), whose sum is σ = 48554066545920. Its totient is φ = 6051966732000.
The previous prime is 20000021332283. The next prime is 20000021332387. The reversal of 20000021332302 is 20323312000002.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (18).
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 31 ways as a sum of consecutive naturals, for example, 23599348 + ... + 24432135.
It is an arithmetic number, because the mean of its divisors is an integer number (758657289780).
Almost surely, 220000021332302 is an apocalyptic number.
20000021332302 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
20000021332302 is an abundant number, since it is smaller than the sum of its proper divisors (28554045213618).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20000021332302 is a wasteful number, since it uses less digits than its factorization.
20000021332302 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48032206 (or 48032200 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 18.
Adding to 20000021332302 its reverse (20323312000002), we get a palindrome (40323333332304).
The spelling of 20000021332302 in words is "twenty trillion, twenty-one million, three hundred thirty-two thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •