Base | Representation |
---|---|
bin | 1100011000000001110… |
… | …0001101110001110000 |
3 | 202022210000222112212110 |
4 | 3012000130031301300 |
5 | 11440410204340431 |
6 | 241400525125320 |
7 | 21234426353610 |
oct | 3060034156160 |
9 | 668700875773 |
10 | 212608277616 |
11 | 82191914849 |
12 | 352560b9840 |
13 | 170834ba187 |
14 | a40c7dca40 |
15 | 57e52ea346 |
hex | 318070dc70 |
212608277616 has 160 divisors (see below), whose sum is σ = 648539570176. Its totient is φ = 58732128000.
The previous prime is 212608277603. The next prime is 212608277617. The reversal of 212608277616 is 616772806212.
It is a Smith number, since the sum of its digits (48) coincides with the sum of the digits of its prime factors.
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 (212608277617) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 12188421 + ... + 12205851.
Almost surely, 2212608277616 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 212608277616, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (324269785088).
212608277616 is an abundant number, since it is smaller than the sum of its proper divisors (435931292560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
212608277616 is a wasteful number, since it uses less digits than its factorization.
212608277616 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18651 (or 18645 counting only the distinct ones).
The product of its (nonzero) digits is 677376, while the sum is 48.
The spelling of 212608277616 in words is "two hundred twelve billion, six hundred eight million, two hundred seventy-seven thousand, six hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 5.098 sec. • engine limits •