Base | Representation |
---|---|
bin | 1111001000111111110… |
… | …1110000001100001000 |
3 | 220212101202012011122122 |
4 | 3302033331300030020 |
5 | 13230203010232231 |
6 | 315254444110412 |
7 | 24535565101061 |
oct | 3621775601410 |
9 | 825352164578 |
10 | 260113367816 |
11 | a034a240175 |
12 | 424b3535408 |
13 | 1b6b43c05c3 |
14 | c837a45568 |
15 | 6b75b1c77b |
hex | 3c8ff70308 |
260113367816 has 8 divisors (see below), whose sum is σ = 487712564670. Its totient is φ = 130056683904.
The previous prime is 260113367771. The next prime is 260113367819. The reversal of 260113367816 is 618763311062.
260113367816 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 143254680100 + 116858687716 = 378490^2 + 341846^2 .
It is a tau number, because it is divible by the number of its divisors (8).
It is not an unprimeable number, because it can be changed into a prime (260113367819) by changing a digit.
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 as a sum of consecutive naturals, namely, 16257085481 + ... + 16257085496.
Almost surely, 2260113367816 is an apocalyptic number.
It is an amenable number.
260113367816 is a deficient number, since it is larger than the sum of its proper divisors (227599196854).
260113367816 is a wasteful number, since it uses less digits than its factorization.
260113367816 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32514170983 (or 32514170979 counting only the distinct ones).
The product of its (nonzero) digits is 217728, while the sum is 44.
Adding to 260113367816 its reverse (618763311062), we get a palindrome (878876678878).
The spelling of 260113367816 in words is "two hundred sixty billion, one hundred thirteen million, three hundred sixty-seven thousand, eight hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •