Base | Representation |
---|---|
bin | 1111001001001011000… |
… | …0000101011110110100 |
3 | 220212112000011021000022 |
4 | 3302102300011132310 |
5 | 13230301442213120 |
6 | 315303234104312 |
7 | 24540003335063 |
oct | 3622260053664 |
9 | 825460137008 |
10 | 260160116660 |
11 | a0373670284 |
12 | 4250711b098 |
13 | 1b6c0caac42 |
14 | c83dd341da |
15 | 6b79ca4025 |
hex | 3c92c057b4 |
260160116660 has 48 divisors (see below), whose sum is σ = 570258202752. Its totient is φ = 99510153600.
The previous prime is 260160116651. The next prime is 260160116669. The reversal of 260160116660 is 66611061062.
It is an interprime number because it is at equal distance from previous prime (260160116651) and next prime (260160116669).
It is a self number, because there is not a number n which added to its sum of digits gives 260160116660.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (260160116669) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1510355 + ... + 1673765.
It is an arithmetic number, because the mean of its divisors is an integer number (11880379224).
Almost surely, 2260160116660 is an apocalyptic number.
260160116660 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
260160116660 is an abundant number, since it is smaller than the sum of its proper divisors (310098086092).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
260160116660 is a wasteful number, since it uses less digits than its factorization.
260160116660 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 166904 (or 166902 counting only the distinct ones).
The product of its (nonzero) digits is 15552, while the sum is 35.
The spelling of 260160116660 in words is "two hundred sixty billion, one hundred sixty million, one hundred sixteen thousand, six hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •