Base | Representation |
---|---|
bin | 11001110100000… |
… | …10011010000111 |
3 | 120002110102010220 |
4 | 30322002122013 |
5 | 420413301212 |
6 | 33253115423 |
7 | 5236365210 |
oct | 1472023207 |
9 | 502412126 |
10 | 216540807 |
11 | 10126034a |
12 | 60628b73 |
13 | 35b29072 |
14 | 20a8a407 |
15 | 1402538c |
hex | ce82687 |
216540807 has 8 divisors (see below), whose sum is σ = 329966976. Its totient is φ = 123737592.
The previous prime is 216540769. The next prime is 216540809. The reversal of 216540807 is 708045612.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 216540807 - 210 = 216539783 is a prime.
It is a super-2 number, since 2×2165408072 = 93779842192422498, which contains 22 as substring.
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (216540809) 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 7 ways as a sum of consecutive naturals, for example, 5155713 + ... + 5155754.
It is an arithmetic number, because the mean of its divisors is an integer number (41245872).
Almost surely, 2216540807 is an apocalyptic number.
216540807 is a deficient number, since it is larger than the sum of its proper divisors (113426169).
216540807 is a wasteful number, since it uses less digits than its factorization.
216540807 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10311477.
The product of its (nonzero) digits is 13440, while the sum is 33.
The square root of 216540807 is about 14715.3255825347. The cubic root of 216540807 is about 600.5003298896.
The spelling of 216540807 in words is "two hundred sixteen million, five hundred forty thousand, eight hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •