Base | Representation |
---|---|
bin | 1000000100011010… |
… | …1100011010011001 |
3 | 12120221201222212112 |
4 | 2001012230122121 |
5 | 13414000000031 |
6 | 554533122105 |
7 | 104450554256 |
oct | 20106543231 |
9 | 5527658775 |
10 | 2166015641 |
11 | a11728679 |
12 | 505489335 |
13 | 286992c7a |
14 | 16795242d |
15 | ca25762b |
hex | 811ac699 |
2166015641 has 4 divisors (see below), whose sum is σ = 2166209232. Its totient is φ = 2165822052.
The previous prime is 2166015629. The next prime is 2166015689. The reversal of 2166015641 is 1465106612.
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.
It is a cyclic number.
It is not a de Polignac number, because 2166015641 - 218 = 2165753497 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2166015598 and 2166015607.
It is not an unprimeable number, because it can be changed into a prime (2166017641) 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 3 ways as a sum of consecutive naturals, for example, 78911 + ... + 102756.
It is an arithmetic number, because the mean of its divisors is an integer number (541552308).
Almost surely, 22166015641 is an apocalyptic number.
It is an amenable number.
2166015641 is a deficient number, since it is larger than the sum of its proper divisors (193591).
2166015641 is a wasteful number, since it uses less digits than its factorization.
2166015641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 193590.
The product of its (nonzero) digits is 8640, while the sum is 32.
The square root of 2166015641 is about 46540.4731497221. The cubic root of 2166015641 is about 1293.8597300070.
The spelling of 2166015641 in words is "two billion, one hundred sixty-six million, fifteen thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •