Base | Representation |
---|---|
bin | 1001100011100100001001… |
… | …11110101000001010110000 |
3 | 2202101211202210202101100220 |
4 | 10301302010332220022300 |
5 | 10223240024010201000 |
6 | 112405200314413040 |
7 | 4266103646430021 |
oct | 461620476501260 |
9 | 82354683671326 |
10 | 21013211022000 |
11 | 677171a89932a |
12 | 2434601a31180 |
13 | b956ca597352 |
14 | 52908b080c48 |
15 | 2669063341a0 |
hex | 131c84fa82b0 |
21013211022000 has 160 divisors (see below), whose sum is σ = 69398949057984. Its totient is φ = 5466851584000.
The previous prime is 21013211021963. The next prime is 21013211022007. The reversal of 21013211022000 is 22011231012.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is not an unprimeable number, because it can be changed into a prime (21013211022007) by changing a digit.
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, 42463779 + ... + 42955778.
Almost surely, 221013211022000 is an apocalyptic number.
21013211022000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
21013211022000 is an abundant number, since it is smaller than the sum of its proper divisors (48385738035984).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21013211022000 is a wasteful number, since it uses less digits than its factorization.
21013211022000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 85419624 (or 85419608 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 21013211022000 its reverse (22011231012), we get a palindrome (21035222253012).
The spelling of 21013211022000 in words is "twenty-one trillion, thirteen billion, two hundred eleven million, twenty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •