Base | Representation |
---|---|
bin | 1100010010110010010… |
… | …0010000100011110100 |
3 | 202012010222010112002201 |
4 | 3010230210100203310 |
5 | 11430014440200040 |
6 | 241005140314244 |
7 | 21154521505201 |
oct | 3045444204364 |
9 | 665128115081 |
10 | 211201100020 |
11 | 8162a573459 |
12 | 34b229a2984 |
13 | 16bbaac7701 |
14 | a31797cca8 |
15 | 57619d8a9a |
hex | 312c9108f4 |
211201100020 has 12 divisors (see below), whose sum is σ = 443522310084. Its totient is φ = 84480440000.
The previous prime is 211201100017. The next prime is 211201100081. The reversal of 211201100020 is 20001102112.
It can be written as a sum of positive squares in 2 ways, for example, as 121601453796 + 89599646224 = 348714^2 + 299332^2 .
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5280027481 + ... + 5280027520.
It is an arithmetic number, because the mean of its divisors is an integer number (36960192507).
Almost surely, 2211201100020 is an apocalyptic number.
211201100020 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
211201100020 is an abundant number, since it is smaller than the sum of its proper divisors (232321210064).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211201100020 is a wasteful number, since it uses less digits than its factorization.
211201100020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10560055010 (or 10560055008 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 211201100020 its reverse (20001102112), we get a palindrome (231202202132).
The spelling of 211201100020 in words is "two hundred eleven billion, two hundred one million, one hundred thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •