Base | Representation |
---|---|
bin | 1100010010000100101… |
… | …1101100001010101000 |
3 | 202011122122202020012201 |
4 | 3010201023230022220 |
5 | 11424122042010440 |
6 | 240534154545544 |
7 | 21150012225265 |
oct | 3044113541250 |
9 | 664578666181 |
10 | 211010110120 |
11 | 81541784967 |
12 | 34a8aa382b4 |
13 | 16b8a376534 |
14 | a2da46426c |
15 | 574ed5e19a |
hex | 31212ec2a8 |
211010110120 has 64 divisors (see below), whose sum is σ = 481093638480. Its totient is φ = 83285508096.
The previous prime is 211010110093. The next prime is 211010110121. The reversal of 211010110120 is 21011010112.
It can be written as a sum of positive squares in 8 ways, for example, as 129918435364 + 81091674756 = 360442^2 + 284766^2 .
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a junction number, because it is equal to n+sod(n) for n = 211010110097 and 211010110106.
It is not an unprimeable number, because it can be changed into a prime (211010110121) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1226872 + ... + 1388248.
Almost surely, 2211010110120 is an apocalyptic number.
211010110120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
211010110120 is an abundant number, since it is smaller than the sum of its proper divisors (270083528360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211010110120 is a wasteful number, since it uses less digits than its factorization.
211010110120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 161822 (or 161818 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 211010110120 its reverse (21011010112), we get a palindrome (232021120232).
The spelling of 211010110120 in words is "two hundred eleven billion, ten million, one hundred ten thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •