Base | Representation |
---|---|
bin | 1001000110000110111100… |
… | …11101111001100010110010 |
3 | 2121211002100001111212212122 |
4 | 10203003132131321202302 |
5 | 10110144223112010002 |
6 | 110312213433154242 |
7 | 4133013622553444 |
oct | 443033635714262 |
9 | 77732301455778 |
10 | 20001100110002 |
11 | 6411467647a60 |
12 | 22b041bb5b982 |
13 | b211321a27bb |
14 | 4d20b63c8494 |
15 | 24a41b73e6a2 |
hex | 1230de7798b2 |
20001100110002 has 32 divisors (see below), whose sum is σ = 33820006491648. Its totient is φ = 8798137590000.
The previous prime is 20001100109923. The next prime is 20001100110007.
20001100110002 is nontrivially palindromic in base 10.
It is a super-2 number, since 2×200011001100022 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (20001100110007) 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, 14603249 + ... + 15914052.
It is an arithmetic number, because the mean of its divisors is an integer number (1056875202864).
Almost surely, 220001100110002 is an apocalyptic number.
20001100110002 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
20001100110002 is a deficient number, since it is larger than the sum of its proper divisors (13818906381646).
20001100110002 is an equidigital number, since it uses as much as digits as its factorization.
20001100110002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30517407 (or 30517345 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 8.
It can be divided in two parts, 20001100 and 110002, that added together give a palindrome (20111102).
The spelling of 20001100110002 in words is "twenty trillion, one billion, one hundred million, one hundred ten thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •