Base | Representation |
---|---|
bin | 1111001001001010001… |
… | …1110111100111001000 |
3 | 220212111210010112221201 |
4 | 3302102203313213020 |
5 | 13230300132222440 |
6 | 315303041313544 |
7 | 24536634166165 |
oct | 3622243674710 |
9 | 825453115851 |
10 | 260156914120 |
11 | a0371883154 |
12 | 425060358b4 |
13 | 1b6c042934c |
14 | c83d73d06c |
15 | 6b7987019a |
hex | 3c928f79c8 |
260156914120 has 128 divisors (see below), whose sum is σ = 610815744000. Its totient is φ = 99612426240.
The previous prime is 260156914093. The next prime is 260156914141. The reversal of 260156914120 is 21419651062.
It is a self number, because there is not a number n which added to its sum of digits gives 260156914120.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 103936789 + ... + 103939291.
It is an arithmetic number, because the mean of its divisors is an integer number (4771998000).
Almost surely, 2260156914120 is an apocalyptic number.
260156914120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 260156914120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (305407872000).
260156914120 is an abundant number, since it is smaller than the sum of its proper divisors (350658829880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
260156914120 is a wasteful number, since it uses less digits than its factorization.
260156914120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3423 (or 3419 counting only the distinct ones).
The product of its (nonzero) digits is 25920, while the sum is 37.
The spelling of 260156914120 in words is "two hundred sixty billion, one hundred fifty-six million, nine hundred fourteen thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •