Base | Representation |
---|---|
bin | 11001001010101… |
… | …11000010111000 |
3 | 112201021000121211 |
4 | 30211113002320 |
5 | 413021322222 |
6 | 32541012504 |
7 | 5142331054 |
oct | 1445270270 |
9 | 481230554 |
10 | 211120312 |
11 | a91988a7 |
12 | 5a854134 |
13 | 3497ba80 |
14 | 20078c64 |
15 | 13804277 |
hex | c9570b8 |
211120312 has 32 divisors (see below), whose sum is σ = 444840480. Its totient is φ = 93202560.
The previous prime is 211120303. The next prime is 211120337. The reversal of 211120312 is 213021112.
It is a super-2 number, since 2×2111203122 = 89143572277954688, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a junction number, because it is equal to n+sod(n) for n = 211120292 and 211120301.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 41739 + ... + 46522.
It is an arithmetic number, because the mean of its divisors is an integer number (13901265).
Almost surely, 2211120312 is an apocalyptic number.
It is an amenable number.
211120312 is an abundant number, since it is smaller than the sum of its proper divisors (233720168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211120312 is a wasteful number, since it uses less digits than its factorization.
211120312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88303 (or 88299 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 13.
The square root of 211120312 is about 14529.9797659873. The cubic root of 211120312 is about 595.4473128094.
Adding to 211120312 its reverse (213021112), we get a palindrome (424141424).
The spelling of 211120312 in words is "two hundred eleven million, one hundred twenty thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •