Base | Representation |
---|---|
bin | 1100010011010001100… |
… | …0000111000010001000 |
3 | 202012111002200200120001 |
4 | 3010310120013002020 |
5 | 11430302011224000 |
6 | 241030141012344 |
7 | 21161002330432 |
oct | 3046430070210 |
9 | 665432620501 |
10 | 211332133000 |
11 | 8169753047a |
12 | 34b5a8540b4 |
13 | 16c0bcb5411 |
14 | a32b12b652 |
15 | 576d26d46a |
hex | 3134607088 |
211332133000 has 32 divisors (see below), whose sum is σ = 494517193560. Its totient is φ = 84532852800.
The previous prime is 211332132919. The next prime is 211332133087. The reversal of 211332133000 is 331233112.
It can be written as a sum of positive squares in 4 ways, for example, as 118318112676 + 93014020324 = 343974^2 + 304982^2 .
It is a super-2 number, since 2×2113321330002 (a number of 23 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 105665067 + ... + 105667066.
Almost surely, 2211332133000 is an apocalyptic number.
211332133000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
211332133000 is an abundant number, since it is smaller than the sum of its proper divisors (283185060560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211332133000 is a wasteful number, since it uses less digits than its factorization.
211332133000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 211332154 (or 211332140 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 211332133000 its reverse (331233112), we get a palindrome (211663366112).
The spelling of 211332133000 in words is "two hundred eleven billion, three hundred thirty-two million, one hundred thirty-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •