Base | Representation |
---|---|
bin | 11001110000101… |
… | …11001000101001 |
3 | 120001122002102012 |
4 | 30320113020221 |
5 | 420310221132 |
6 | 33235445305 |
7 | 5232555200 |
oct | 1470271051 |
9 | 501562365 |
10 | 216101417 |
11 | 100a90214 |
12 | 60456835 |
13 | 35a0407c |
14 | 209b4237 |
15 | 13e8a0b2 |
hex | ce17229 |
216101417 has 12 divisors (see below), whose sum is σ = 260053380. Its totient is φ = 178841376.
The previous prime is 216101407. The next prime is 216101437. The reversal of 216101417 is 714101612.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 95628841 + 120472576 = 9779^2 + 10976^2 .
It is a de Polignac number, because none of the positive numbers 2k-216101417 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 216101392 and 216101401.
It is not an unprimeable number, because it can be changed into a prime (216101407) 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 11 ways as a sum of consecutive naturals, for example, 74618 + ... + 77459.
It is an arithmetic number, because the mean of its divisors is an integer number (21671115).
Almost surely, 2216101417 is an apocalyptic number.
It is an amenable number.
216101417 is a deficient number, since it is larger than the sum of its proper divisors (43951963).
216101417 is a wasteful number, since it uses less digits than its factorization.
216101417 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 152120 (or 152113 counting only the distinct ones).
The product of its (nonzero) digits is 336, while the sum is 23.
The square root of 216101417 is about 14700.3883282041. The cubic root of 216101417 is about 600.0938899367.
The spelling of 216101417 in words is "two hundred sixteen million, one hundred one thousand, four hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •