Base | Representation |
---|---|
bin | 1100010011001010100… |
… | …1110100101100000100 |
3 | 202012102002021212011000 |
4 | 3010302221310230010 |
5 | 11430222111101040 |
6 | 241023225213300 |
7 | 21160201516032 |
oct | 3046251645404 |
9 | 665362255130 |
10 | 211303222020 |
11 | 81682184200 |
12 | 34b51031230 |
13 | 16c06002027 |
14 | a327363552 |
15 | 576a95c130 |
hex | 3132a74b04 |
211303222020 has 144 divisors (see below), whose sum is σ = 722583509760. Its totient is φ = 51225007680.
The previous prime is 211303221979. The next prime is 211303222027. The reversal of 211303222020 is 20222303112.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 211303221984 and 211303222002.
It is not an unprimeable number, because it can be changed into a prime (211303222027) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1551612 + ... + 1682291.
It is an arithmetic number, because the mean of its divisors is an integer number (5017941040).
Almost surely, 2211303222020 is an apocalyptic number.
211303222020 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
211303222020 is an abundant number, since it is smaller than the sum of its proper divisors (511280287740).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211303222020 is a wasteful number, since it uses less digits than its factorization.
211303222020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3233943 (or 3233924 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 211303222020 its reverse (20222303112), we get a palindrome (231525525132).
The spelling of 211303222020 in words is "two hundred eleven billion, three hundred three million, two hundred twenty-two thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •