Base | Representation |
---|---|
bin | 1001100011110000110011… |
… | …01101001011010110100000 |
3 | 2202102111022000201011220201 |
4 | 10301320121231023112200 |
5 | 10223342430303020000 |
6 | 112412242200114544 |
7 | 4266434140235446 |
oct | 461703155132640 |
9 | 82374260634821 |
10 | 21020001220000 |
11 | 6774594775612 |
12 | 2435997a65a54 |
13 | b962402935a3 |
14 | 529532bc6b96 |
15 | 266ba250996a |
hex | 131e19b4b5a0 |
21020001220000 has 120 divisors (see below), whose sum is σ = 54754260181236. Its totient is φ = 7913412096000.
The previous prime is 21020001219989. The next prime is 21020001220007. The reversal of 21020001220000 is 2210002012.
It can be written as a sum of positive squares in 10 ways, for example, as 4437611886096 + 16582389333904 = 2106564^2 + 4072148^2 .
It is a Harshad number since it is a multiple of its sum of digits (10).
It is not an unprimeable number, because it can be changed into a prime (21020001220007) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 30571767 + ... + 31251766.
Almost surely, 221020001220000 is an apocalyptic number.
21020001220000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
21020001220000 is an abundant number, since it is smaller than the sum of its proper divisors (33734258961236).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21020001220000 is an equidigital number, since it uses as much as digits as its factorization.
21020001220000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61823580 (or 61823557 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 10.
Adding to 21020001220000 its reverse (2210002012), we get a palindrome (21022211222012).
The spelling of 21020001220000 in words is "twenty-one trillion, twenty billion, one million, two hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •