Base | Representation |
---|---|
bin | 101111111110100110100100… |
… | …101011101110101011110100 |
3 | 1000200010101020102111001102121 |
4 | 233332212210223232223310 |
5 | 210124142403032241040 |
6 | 2024440430334445324 |
7 | 62305661512415443 |
oct | 5776464453565364 |
9 | 1020111212431377 |
10 | 211010211212020 |
11 | 61263a23227a60 |
12 | 1b7bb238963844 |
13 | 9098240081b0c |
14 | 3a16d3d3bcd5a |
15 | 195dcd6e27c4a |
hex | bfe9a4aeeaf4 |
211010211212020 has 48 divisors (see below), whose sum is σ = 483445544637888. Its totient is φ = 76724583752960.
The previous prime is 211010211211931. The next prime is 211010211212063. The reversal of 211010211212020 is 20212112010112.
It is a junction number, because it is equal to n+sod(n) for n = 211010211211985 and 211010211212003.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 37370257 + ... + 42644536.
It is an arithmetic number, because the mean of its divisors is an integer number (10071782179956).
Almost surely, 2211010211212020 is an apocalyptic number.
211010211212020 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
211010211212020 is an abundant number, since it is smaller than the sum of its proper divisors (272435333425868).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211010211212020 is a wasteful number, since it uses less digits than its factorization.
211010211212020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 80026800 (or 80026798 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 211010211212020 its reverse (20212112010112), we get a palindrome (231222323222132).
The spelling of 211010211212020 in words is "two hundred eleven trillion, ten billion, two hundred eleven million, two hundred twelve thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •