Base | Representation |
---|---|
bin | 1100010010011100100… |
… | …1001010111101101010 |
3 | 202011220121220220112220 |
4 | 3010213021022331222 |
5 | 11424323142110010 |
6 | 240552130214510 |
7 | 21152335232250 |
oct | 3044711127552 |
9 | 664817826486 |
10 | 211110113130 |
11 | 81593178684 |
12 | 34ab8424436 |
13 | 16ba4cbb507 |
14 | a3098565d0 |
15 | 5758a14970 |
hex | 312724af6a |
211110113130 has 64 divisors (see below), whose sum is σ = 579180291840. Its totient is φ = 48242456064.
The previous prime is 211110113129. The next prime is 211110113173. The reversal of 211110113130 is 31311011112.
211110113130 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×2111101131302 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 799606 + ... + 1030334.
It is an arithmetic number, because the mean of its divisors is an integer number (9049692060).
Almost surely, 2211110113130 is an apocalyptic number.
211110113130 is an abundant number, since it is smaller than the sum of its proper divisors (368070178710).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211110113130 is a wasteful number, since it uses less digits than its factorization.
211110113130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 235103.
The product of its (nonzero) digits is 18, while the sum is 15.
Adding to 211110113130 its reverse (31311011112), we get a palindrome (242421124242).
The spelling of 211110113130 in words is "two hundred eleven billion, one hundred ten million, one hundred thirteen thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •