Base | Representation |
---|---|
bin | 1100010011001010001… |
… | …0100110110011010010 |
3 | 202012101221201201222000 |
4 | 3010302202212303102 |
5 | 11430221120031010 |
6 | 241023120454430 |
7 | 21160146446232 |
oct | 3046242466322 |
9 | 665357651860 |
10 | 211301330130 |
11 | 81681101860 |
12 | 34b5047a416 |
13 | 16c057bbb77 |
14 | a326dcdcc2 |
15 | 576a6d67c0 |
hex | 31328a6cd2 |
211301330130 has 64 divisors (see below), whose sum is σ = 614694787200. Its totient is φ = 51224564160.
The previous prime is 211301330111. The next prime is 211301330147. The reversal of 211301330130 is 31033103112.
It is a happy number.
211301330130 is a `hidden beast` number, since 2 + 1 + 1 + 301 + 330 + 1 + 30 = 666.
It is a super-2 number, since 2×2113013301302 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 35569645 + ... + 35575584.
It is an arithmetic number, because the mean of its divisors is an integer number (9604606050).
Almost surely, 2211301330130 is an apocalyptic number.
211301330130 is an abundant number, since it is smaller than the sum of its proper divisors (403393457070).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211301330130 is a wasteful number, since it uses less digits than its factorization.
211301330130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 71145256 (or 71145250 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 18.
Adding to 211301330130 its reverse (31033103112), we get a palindrome (242334433242).
The spelling of 211301330130 in words is "two hundred eleven billion, three hundred one million, three hundred thirty thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •