Base | Representation |
---|---|
bin | 1001100011100010010010… |
… | …10100000010010011001100 |
3 | 2202101202012001011020211202 |
4 | 10301301021110002103030 |
5 | 10223231001230013400 |
6 | 112404513115205032 |
7 | 4266040103044523 |
oct | 461611124022314 |
9 | 82352161136752 |
10 | 21012210001100 |
11 | 677125683852a |
12 | 2434382746778 |
13 | b9559b0905a6 |
14 | 528dd41494ba |
15 | 2668985004d5 |
hex | 131c495024cc |
21012210001100 has 36 divisors (see below), whose sum is σ = 45612591091704. Its totient is φ = 8401917108480.
The previous prime is 21012210001073. The next prime is 21012210001103. The reversal of 21012210001100 is 110001221012.
It is not an unprimeable number, because it can be changed into a prime (21012210001103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 36801434 + ... + 37368033.
It is an arithmetic number, because the mean of its divisors is an integer number (1267016419214).
Almost surely, 221012210001100 is an apocalyptic number.
21012210001100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
21012210001100 is an abundant number, since it is smaller than the sum of its proper divisors (24600381090604).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21012210001100 is a wasteful number, since it uses less digits than its factorization.
21012210001100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74172314 (or 74172307 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 21012210001100 its reverse (110001221012), we get a palindrome (21122211222112).
The spelling of 21012210001100 in words is "twenty-one trillion, twelve billion, two hundred ten million, one thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •