Base | Representation |
---|---|
bin | 1001100011100010000101… |
… | …10101000010001101111000 |
3 | 2202101201220110110010212210 |
4 | 10301301002311002031320 |
5 | 10223230240402223000 |
6 | 112404454231335120 |
7 | 4266034312252314 |
oct | 461610265021570 |
9 | 82351813403783 |
10 | 21012101211000 |
11 | 6771200392959 |
12 | 24343522214a0 |
13 | b9558168cb53 |
14 | 528dc390ab44 |
15 | 26688dbb1350 |
hex | 131c42d42378 |
21012101211000 has 64 divisors (see below), whose sum is σ = 65557755787680. Its totient is φ = 5603226988800.
The previous prime is 21012101210963. The next prime is 21012101211007. The reversal of 21012101211000 is 11210121012.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21012101211007) 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 15 ways as a sum of consecutive naturals, for example, 3502013869 + ... + 3502019868.
Almost surely, 221012101211000 is an apocalyptic number.
21012101211000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
21012101211000 is an abundant number, since it is smaller than the sum of its proper divisors (44545654576680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21012101211000 is a wasteful number, since it uses less digits than its factorization.
21012101211000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7004033761 (or 7004033747 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 21012101211000 its reverse (11210121012), we get a palindrome (21023311332012).
The spelling of 21012101211000 in words is "twenty-one trillion, twelve billion, one hundred one million, two hundred eleven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •