Base | Representation |
---|---|
bin | 111011001001110001010011… |
… | …001110000100000111111111 |
3 | 1021010010200111202200010212222 |
4 | 323021301103032010013333 |
5 | 233044344301220433101 |
6 | 2321150030544515555 |
7 | 105540443023214300 |
oct | 7311612316040777 |
9 | 1233120452603788 |
10 | 260156155249151 |
11 | 75991673421377 |
12 | 2521800a01bbbb |
13 | b22180a6a1785 |
14 | 48358a73b07a7 |
15 | 20123d2cc401b |
hex | ec9c533841ff |
260156155249151 has 24 divisors (see below), whose sum is σ = 302686745961600. Its totient is φ = 222949645998912.
The previous prime is 260156155249121. The next prime is 260156155249183. The reversal of 260156155249151 is 151942551651062.
It is not a de Polignac number, because 260156155249151 - 242 = 255758108738047 is a prime.
It is a super-2 number, since 2×2601561552491512 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 260156155249093 and 260156155249102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (260156155249121) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 10116103145 + ... + 10116128861.
It is an arithmetic number, because the mean of its divisors is an integer number (12611947748400).
Almost surely, 2260156155249151 is an apocalyptic number.
260156155249151 is a deficient number, since it is larger than the sum of its proper divisors (42530590712449).
260156155249151 is a wasteful number, since it uses less digits than its factorization.
260156155249151 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 55983 (or 55976 counting only the distinct ones).
The product of its (nonzero) digits is 3240000, while the sum is 53.
The spelling of 260156155249151 in words is "two hundred sixty trillion, one hundred fifty-six billion, one hundred fifty-five million, two hundred forty-nine thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •