Base | Representation |
---|---|
bin | 1101110101000… |
… | …01110100111001 |
3 | 22002021201120222 |
4 | 12322201310321 |
5 | 214144144301 |
6 | 15302225425 |
7 | 2606015333 |
oct | 672416471 |
9 | 262251528 |
10 | 116006201 |
11 | 5a5341a3 |
12 | 32a25275 |
13 | 1b05912c |
14 | 1159a453 |
15 | a2b731b |
hex | 6ea1d39 |
116006201 has 8 divisors (see below), whose sum is σ = 118668744. Its totient is φ = 113368320.
The previous prime is 116006197. The next prime is 116006221. The reversal of 116006201 is 102600611.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 1537600 + 114468601 = 1240^2 + 10699^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 116006201 - 22 = 116006197 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 116006201.
It is not an unprimeable number, because it can be changed into a prime (116006221) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3521 + ... + 15633.
It is an arithmetic number, because the mean of its divisors is an integer number (14833593).
Almost surely, 2116006201 is an apocalyptic number.
It is an amenable number.
116006201 is a deficient number, since it is larger than the sum of its proper divisors (2662543).
116006201 is a wasteful number, since it uses less digits than its factorization.
116006201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12331.
The product of its (nonzero) digits is 72, while the sum is 17.
The square root of 116006201 is about 10770.6174846199. The cubic root of 116006201 is about 487.7085862601.
Adding to 116006201 its reverse (102600611), we get a palindrome (218606812).
The spelling of 116006201 in words is "one hundred sixteen million, six thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •