Base | Representation |
---|---|
bin | 111011010011001101101011… |
… | …011001110101100101110110 |
3 | 1021012102201112220200111221120 |
4 | 323103031223121311211312 |
5 | 233141012321332101410 |
6 | 2322404113121324410 |
7 | 105635355350420652 |
oct | 7323155331654566 |
9 | 1235381486614846 |
10 | 260805101050230 |
11 | 76111905405740 |
12 | 25301938796706 |
13 | b26aa7a866149 |
14 | 4859069d69a62 |
15 | 2024214b9b570 |
hex | ed336b675976 |
260805101050230 has 64 divisors (see below), whose sum is σ = 682913496960000. Its totient is φ = 63218226885120.
The previous prime is 260805101050223. The next prime is 260805101050331. The reversal of 260805101050230 is 32050101508062.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a junction number, because it is equal to n+sod(n) for n = 260805101050191 and 260805101050200.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 42444355 + ... + 48198894.
It is an arithmetic number, because the mean of its divisors is an integer number (10670523390000).
Almost surely, 2260805101050230 is an apocalyptic number.
260805101050230 is an abundant number, since it is smaller than the sum of its proper divisors (422108395909770).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
260805101050230 is a wasteful number, since it uses less digits than its factorization.
260805101050230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90651989.
The product of its (nonzero) digits is 14400, while the sum is 33.
Adding to 260805101050230 its reverse (32050101508062), we get a palindrome (292855202558292).
The spelling of 260805101050230 in words is "two hundred sixty trillion, eight hundred five billion, one hundred one million, fifty thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •