Base | Representation |
---|---|
bin | 1000000100001100… |
… | …1101100111010100 |
3 | 12120220000122001020 |
4 | 2001003031213110 |
5 | 13413231244220 |
6 | 554501401140 |
7 | 104440033551 |
oct | 20103154724 |
9 | 5526018036 |
10 | 2165103060 |
11 | a11164a7a |
12 | 5051091b0 |
13 | 286733793 |
14 | 167795a28 |
15 | ca127040 |
hex | 810cd9d4 |
2165103060 has 24 divisors (see below), whose sum is σ = 6062288736. Its totient is φ = 577360800.
The previous prime is 2165103049. The next prime is 2165103077. The reversal of 2165103060 is 603015612.
It is a self number, because there is not a number n which added to its sum of digits gives 2165103060.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 18042466 + ... + 18042585.
It is an arithmetic number, because the mean of its divisors is an integer number (252595364).
Almost surely, 22165103060 is an apocalyptic number.
2165103060 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2165103060 is an abundant number, since it is smaller than the sum of its proper divisors (3897185676).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2165103060 is a wasteful number, since it uses less digits than its factorization.
2165103060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36085063 (or 36085061 counting only the distinct ones).
The product of its (nonzero) digits is 1080, while the sum is 24.
The square root of 2165103060 is about 46530.6679513630. The cubic root of 2165103060 is about 1293.6779957593.
Adding to 2165103060 its reverse (603015612), we get a palindrome (2768118672).
The spelling of 2165103060 in words is "two billion, one hundred sixty-five million, one hundred three thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •