Base | Representation |
---|---|
bin | 110000000011010000100111… |
… | …010110110011010011011000 |
3 | 1000201020222021011101211120020 |
4 | 300003100213112303103120 |
5 | 210144413303131333422 |
6 | 2025243433512030440 |
7 | 62341051063645035 |
oct | 6003204726632330 |
9 | 1021228234354506 |
10 | 211330231121112 |
11 | 61377714111274 |
12 | 1b85126a992420 |
13 | 90bc48073927c |
14 | 3a2861b30a38c |
15 | 19672b6e8695c |
hex | c034275b34d8 |
211330231121112 has 64 divisors (see below), whose sum is σ = 529045605705600. Its totient is φ = 70347439219200.
The previous prime is 211330231121083. The next prime is 211330231121129. The reversal of 211330231121112 is 211121132033112.
It is a super-2 number, since 2×2113302311211122 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 103116688 + ... + 105146144.
It is an arithmetic number, because the mean of its divisors is an integer number (8266337589150).
Almost surely, 2211330231121112 is an apocalyptic number.
It is an amenable number.
211330231121112 is an abundant number, since it is smaller than the sum of its proper divisors (317715374584488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211330231121112 is a wasteful number, since it uses less digits than its factorization.
211330231121112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2035376 (or 2035372 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 24.
Adding to 211330231121112 its reverse (211121132033112), we get a palindrome (422451363154224).
The spelling of 211330231121112 in words is "two hundred eleven trillion, three hundred thirty billion, two hundred thirty-one million, one hundred twenty-one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •