Base | Representation |
---|---|
bin | 1000000100001100… |
… | …0101101101011001 |
3 | 12120212221222122000 |
4 | 2001003011231121 |
5 | 13413224230211 |
6 | 554500551213 |
7 | 104436540264 |
oct | 20103055531 |
9 | 5525858560 |
10 | 2165070681 |
11 | a11142714 |
12 | 5050b2509 |
13 | 286721b17 |
14 | 167787cdb |
15 | ca11c656 |
hex | 810c5b59 |
2165070681 has 16 divisors (see below), whose sum is σ = 3213960000. Its totient is φ = 1440478944.
The previous prime is 2165070673. The next prime is 2165070689. The reversal of 2165070681 is 1860705612.
It is an interprime number because it is at equal distance from previous prime (2165070673) and next prime (2165070689).
It is not a de Polignac number, because 2165070681 - 23 = 2165070673 is a prime.
It is a super-2 number, since 2×21650706812 = 9375062107451607522, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (2165070689) 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 15 ways as a sum of consecutive naturals, for example, 66876 + ... + 93821.
It is an arithmetic number, because the mean of its divisors is an integer number (200872500).
Almost surely, 22165070681 is an apocalyptic number.
It is an amenable number.
2165070681 is a deficient number, since it is larger than the sum of its proper divisors (1048889319).
2165070681 is a wasteful number, since it uses less digits than its factorization.
2165070681 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 161205 (or 161199 counting only the distinct ones).
The product of its (nonzero) digits is 20160, while the sum is 36.
The square root of 2165070681 is about 46530.3200182419. The cubic root of 2165070681 is about 1293.6715467655.
The spelling of 2165070681 in words is "two billion, one hundred sixty-five million, seventy thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •