Base | Representation |
---|---|
bin | 1111001010100110010… |
… | …1100001110011100100 |
3 | 220220111201001011221022 |
4 | 3302221211201303210 |
5 | 13232043031200220 |
6 | 315405241310312 |
7 | 24552334605146 |
oct | 3625145416344 |
9 | 826451034838 |
10 | 260543225060 |
11 | a054a949298 |
12 | 425b3495398 |
13 | 1b752486bc1 |
14 | c878b7cc96 |
15 | 6b9d72c925 |
hex | 3ca9961ce4 |
260543225060 has 48 divisors (see below), whose sum is σ = 567297561600. Its totient is φ = 100394281344.
The previous prime is 260543225051. The next prime is 260543225077. The reversal of 260543225060 is 60522345062.
260543225060 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 260543225060.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 257012 + ... + 766251.
It is an arithmetic number, because the mean of its divisors is an integer number (11818699200).
Almost surely, 2260543225060 is an apocalyptic number.
260543225060 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
260543225060 is an abundant number, since it is smaller than the sum of its proper divisors (306754336540).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
260543225060 is a wasteful number, since it uses less digits than its factorization.
260543225060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1023740 (or 1023738 counting only the distinct ones).
The product of its (nonzero) digits is 86400, while the sum is 35.
The spelling of 260543225060 in words is "two hundred sixty billion, five hundred forty-three million, two hundred twenty-five thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •