Base | Representation |
---|---|
bin | 1100010010011010011… |
… | …1101000001111000010 |
3 | 202011220000101011211020 |
4 | 3010212213220033002 |
5 | 11424313414221010 |
6 | 240551213530310 |
7 | 21152200420551 |
oct | 3044647501702 |
9 | 664800334736 |
10 | 211101320130 |
11 | 81589212338 |
12 | 34ab54a3996 |
13 | 16ba323015c |
14 | a308607d98 |
15 | 5757d79470 |
hex | 31269e83c2 |
211101320130 has 64 divisors (see below), whose sum is σ = 514347687936. Its totient is φ = 55439384000.
The previous prime is 211101320107. The next prime is 211101320147. The reversal of 211101320130 is 31023101112.
It is a happy number.
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 (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1886035 + ... + 1994825.
It is an arithmetic number, because the mean of its divisors is an integer number (8036682624).
Almost surely, 2211101320130 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 211101320130, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (257173843968).
211101320130 is an abundant number, since it is smaller than the sum of its proper divisors (303246367806).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211101320130 is a wasteful number, since it uses less digits than its factorization.
211101320130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 109783.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 211101320130 its reverse (31023101112), we get a palindrome (242124421242).
The spelling of 211101320130 in words is "two hundred eleven billion, one hundred one million, three hundred twenty thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •