Base | Representation |
---|---|
bin | 11001110001000… |
… | …01110010100110 |
3 | 120001201022021200 |
4 | 30320201302212 |
5 | 420313120222 |
6 | 33240423330 |
7 | 5233126350 |
oct | 1470416246 |
9 | 501638250 |
10 | 216145062 |
11 | 10100aa91 |
12 | 60477b46 |
13 | 35a1abb3 |
14 | 209c60d0 |
15 | 13e97eac |
hex | ce21ca6 |
216145062 has 96 divisors (see below), whose sum is σ = 558792000. Its totient is φ = 59076864.
The previous prime is 216145019. The next prime is 216145063. The reversal of 216145062 is 260541612.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (216145063) by changing a digit.
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 47 ways as a sum of consecutive naturals, for example, 544248 + ... + 544644.
It is an arithmetic number, because the mean of its divisors is an integer number (5820750).
Almost surely, 2216145062 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 216145062, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (279396000).
216145062 is an abundant number, since it is smaller than the sum of its proper divisors (342646938).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
216145062 is a wasteful number, since it uses less digits than its factorization.
216145062 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 590 (or 587 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 27.
The square root of 216145062 is about 14701.8727378521. The cubic root of 216145062 is about 600.1342866096.
Adding to 216145062 its reverse (260541612), we get a palindrome (476686674).
The spelling of 216145062 in words is "two hundred sixteen million, one hundred forty-five thousand, sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •