Base | Representation |
---|---|
bin | 1100010111110011001… |
… | …1100100010111100000 |
3 | 202022121210020002101210 |
4 | 3011330303210113200 |
5 | 11440244101244332 |
6 | 241350510030120 |
7 | 21233056106100 |
oct | 3057463442740 |
9 | 668553202353 |
10 | 212547290592 |
11 | 8216044a34a |
12 | 352397a8340 |
13 | 17073985b90 |
14 | a404685200 |
15 | 57dec9eecc |
hex | 317cce45e0 |
212547290592 has 144 divisors (see below), whose sum is σ = 698953791312. Its totient is φ = 56056412160.
The previous prime is 212547290591. The next prime is 212547290611. The reversal of 212547290592 is 295092745212.
212547290592 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212547290591) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1676709 + ... + 1799012.
It is an arithmetic number, because the mean of its divisors is an integer number (4853845773).
Almost surely, 2212547290592 is an apocalyptic number.
It is an amenable number.
212547290592 is an abundant number, since it is smaller than the sum of its proper divisors (486406500720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212547290592 is a wasteful number, since it uses less digits than its factorization.
212547290592 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3475761 (or 3475746 counting only the distinct ones).
The product of its (nonzero) digits is 907200, while the sum is 48.
The spelling of 212547290592 in words is "two hundred twelve billion, five hundred forty-seven million, two hundred ninety thousand, five hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •