Base | Representation |
---|---|
bin | 11110100011111000111… |
… | …010110111001000110100 |
3 | 21102202202222201000100020 |
4 | 132203320322313020310 |
5 | 233402021234021322 |
6 | 4244440520445140 |
7 | 304504636222560 |
oct | 36437072671064 |
9 | 7382688630306 |
10 | 2100120220212 |
11 | 73a724129133 |
12 | 29b0260197b0 |
13 | 12306ac47021 |
14 | 739098866a0 |
15 | 39967a6305c |
hex | 1e8f8eb7234 |
2100120220212 has 48 divisors (see below), whose sum is σ = 5793435096960. Its totient is φ = 579343508352.
The previous prime is 2100120220169. The next prime is 2100120220213. The reversal of 2100120220212 is 2120220210012.
It is a junction number, because it is equal to n+sod(n) for n = 2100120220191 and 2100120220200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2100120220213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 431056723 + ... + 431061594.
It is an arithmetic number, because the mean of its divisors is an integer number (120696564520).
Almost surely, 22100120220212 is an apocalyptic number.
It is an amenable number.
2100120220212 is an abundant number, since it is smaller than the sum of its proper divisors (3693314876748).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2100120220212 is a wasteful number, since it uses less digits than its factorization.
2100120220212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 862118360 (or 862118358 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 2100120220212 its reverse (2120220210012), we get a palindrome (4220340430224).
The spelling of 2100120220212 in words is "two trillion, one hundred billion, one hundred twenty million, two hundred twenty thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •