Base | Representation |
---|---|
bin | 1100010101100100011… |
… | …1000111000010100000 |
3 | 202021002001101000000000 |
4 | 3011121013013002200 |
5 | 11433032244333233 |
6 | 241211234300000 |
7 | 21212164650204 |
oct | 3053107070240 |
9 | 667061330000 |
10 | 211948433568 |
11 | 81983402193 |
12 | 350b1127600 |
13 | 16ca989a601 |
14 | a388d18b04 |
15 | 57a740ad13 |
hex | 31591c70a0 |
211948433568 has 120 divisors (see below), whose sum is σ = 625901478048. Its totient is φ = 70649267904.
The previous prime is 211948433537. The next prime is 211948433569. The reversal of 211948433568 is 865334849112.
It is a happy number.
211948433568 is a `hidden beast` number, since 2 + 1 + 1 + 9 + 48 + 4 + 33 + 568 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211948433569) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 461605 + ... + 798107.
Almost surely, 2211948433568 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 211948433568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (312950739024).
211948433568 is an abundant number, since it is smaller than the sum of its proper divisors (413953044480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211948433568 is an frugal number, since it uses more digits than its factorization.
211948433568 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 336540 (or 336508 counting only the distinct ones).
The product of its digits is 4976640, while the sum is 54.
The spelling of 211948433568 in words is "two hundred eleven billion, nine hundred forty-eight million, four hundred thirty-three thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •