Base | Representation |
---|---|
bin | 1100010010000100110… |
… | …0001001111101000100 |
3 | 202011122122222102120200 |
4 | 3010201030021331010 |
5 | 11424122104412012 |
6 | 240534201330500 |
7 | 21150013244100 |
oct | 3044114117504 |
9 | 664578872520 |
10 | 211010232132 |
11 | 815418585a7 |
12 | 34a8aa96a30 |
13 | 16b8a3b9c2b |
14 | a2da496900 |
15 | 574ed853dc |
hex | 3121309f44 |
211010232132 has 216 divisors, whose sum is σ = 657483372000. Its totient is φ = 56697822720.
The previous prime is 211010232127. The next prime is 211010232247. The reversal of 211010232132 is 231232010112.
211010232132 is a `hidden beast` number, since 211 + 0 + 102 + 321 + 32 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 60304119 + ... + 60307617.
It is an arithmetic number, because the mean of its divisors is an integer number (3043904500).
Almost surely, 2211010232132 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 211010232132, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (328741686000).
211010232132 is an abundant number, since it is smaller than the sum of its proper divisors (446473139868).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211010232132 is a wasteful number, since it uses less digits than its factorization.
211010232132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5551 (or 5539 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 211010232132 its reverse (231232010112), we get a palindrome (442242242244).
The spelling of 211010232132 in words is "two hundred eleven billion, ten million, two hundred thirty-two thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.127 sec. • engine limits •