Base | Representation |
---|---|
bin | 1000000100001101… |
… | …1010101111110101 |
3 | 12120220010100211120 |
4 | 2001003122233311 |
5 | 13413240004403 |
6 | 554502454153 |
7 | 104440346436 |
oct | 20103325765 |
9 | 5526110746 |
10 | 2165156853 |
11 | a111a1432 |
12 | 505134359 |
13 | 286752102 |
14 | 1677ab48d |
15 | ca137e53 |
hex | 810dabf5 |
2165156853 has 8 divisors (see below), whose sum is σ = 2887962528. Its totient is φ = 1442894544.
The previous prime is 2165156843. The next prime is 2165156863. The reversal of 2165156853 is 3586515612.
It is a happy number.
2165156853 is digitally balanced in base 2 and base 4, because in such bases it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (2165156843) and next prime (2165156863).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2165156853 - 26 = 2165156789 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2165156843) 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, 126450 + ... + 142547.
It is an arithmetic number, because the mean of its divisors is an integer number (360995316).
Almost surely, 22165156853 is an apocalyptic number.
It is an amenable number.
2165156853 is a deficient number, since it is larger than the sum of its proper divisors (722805675).
2165156853 is a wasteful number, since it uses less digits than its factorization.
2165156853 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 271683.
The product of its digits is 216000, while the sum is 42.
The square root of 2165156853 is about 46531.2459858964. The cubic root of 2165156853 is about 1293.6887096825.
The spelling of 2165156853 in words is "two billion, one hundred sixty-five million, one hundred fifty-six thousand, eight hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •