Base | Representation |
---|---|
bin | 1001100011001011111101… |
… | …10001100001011001010000 |
3 | 2202100121020120122202222012 |
4 | 10301211332301201121100 |
5 | 10223031423314134300 |
6 | 112355211355202052 |
7 | 4265134035643022 |
oct | 461457661413120 |
9 | 82317216582865 |
10 | 21000222021200 |
11 | 6767164946824 |
12 | 2431b97a46328 |
13 | b9440a576c66 |
14 | 5285b7d7a012 |
15 | 2663e5d56435 |
hex | 13197ec61650 |
21000222021200 has 60 divisors (see below), whose sum is σ = 51019921508220. Its totient is φ = 8305705774080.
The previous prime is 21000222021179. The next prime is 21000222021227. The reversal of 21000222021200 is 212022200012.
It can be written as a sum of positive squares in 6 ways, for example, as 5800641036304 + 15199580984896 = 2408452^2 + 3898664^2 .
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 294911339 + ... + 294982538.
It is an arithmetic number, because the mean of its divisors is an integer number (850332025137).
Almost surely, 221000222021200 is an apocalyptic number.
21000222021200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
21000222021200 is an abundant number, since it is smaller than the sum of its proper divisors (30019699487020).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21000222021200 is a wasteful number, since it uses less digits than its factorization.
21000222021200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 589893984 (or 589893973 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 21000222021200 its reverse (212022200012), we get a palindrome (21212244221212).
The spelling of 21000222021200 in words is "twenty-one trillion, two hundred twenty-two million, twenty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •