Base | Representation |
---|---|
bin | 1100011000101001110… |
… | …0111111011100010000 |
3 | 202100012202001121001101 |
4 | 3012022130333130100 |
5 | 11441231210100300 |
6 | 241425325314144 |
7 | 21241536211420 |
oct | 3061234773420 |
9 | 670182047041 |
10 | 212776253200 |
11 | 82268714345 |
12 | 352a2405954 |
13 | 170ac240c04 |
14 | a426c46480 |
15 | 5804e2ab6a |
hex | 318a73f710 |
212776253200 has 60 divisors (see below), whose sum is σ = 584222805760. Its totient is φ = 72951857280.
The previous prime is 212776253177. The next prime is 212776253201. The reversal of 212776253200 is 2352677212.
212776253200 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 212776253200.
It is not an unprimeable number, because it can be changed into a prime (212776253201) 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 11 ways as a sum of consecutive naturals, for example, 37992960 + ... + 37998559.
Almost surely, 2212776253200 is an apocalyptic number.
212776253200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
212776253200 is an abundant number, since it is smaller than the sum of its proper divisors (371446552560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212776253200 is a wasteful number, since it uses less digits than its factorization.
212776253200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75991544 (or 75991533 counting only the distinct ones).
The product of its (nonzero) digits is 70560, while the sum is 37.
The spelling of 212776253200 in words is "two hundred twelve billion, seven hundred seventy-six million, two hundred fifty-three thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •