Base | Representation |
---|---|
bin | 1101110110101… |
… | …00011100111001 |
3 | 22002200021000222 |
4 | 12323110130321 |
5 | 214222313221 |
6 | 15310505425 |
7 | 2610541022 |
oct | 673243471 |
9 | 262607028 |
10 | 116213561 |
11 | 5a665a72 |
12 | 32b05275 |
13 | 1b0cc629 |
14 | 11611c49 |
15 | a3089ab |
hex | 6ed4739 |
116213561 has 4 divisors (see below), whose sum is σ = 117341952. Its totient is φ = 115085172.
The previous prime is 116213521. The next prime is 116213597. The reversal of 116213561 is 165312611.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 165312611 = 883 ⋅187217.
It is a cyclic number.
It is not a de Polignac number, because 116213561 - 214 = 116197177 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 116213561.
It is not an unprimeable number, because it can be changed into a prime (116213501) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 564041 + ... + 564246.
It is an arithmetic number, because the mean of its divisors is an integer number (29335488).
Almost surely, 2116213561 is an apocalyptic number.
It is an amenable number.
116213561 is a deficient number, since it is larger than the sum of its proper divisors (1128391).
116213561 is a wasteful number, since it uses less digits than its factorization.
116213561 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1128390.
The product of its digits is 1080, while the sum is 26.
The square root of 116213561 is about 10780.2393758209. The cubic root of 116213561 is about 487.9990048018. Note that the first 3 decimals are identical.
The spelling of 116213561 in words is "one hundred sixteen million, two hundred thirteen thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •