Base | Representation |
---|---|
bin | 1111001011001001100… |
… | …1001111110101111000 |
3 | 220220220000002222000000 |
4 | 3302302121033311320 |
5 | 13232343344010241 |
6 | 315432040513000 |
7 | 24556110642000 |
oct | 3626231176570 |
9 | 826800088000 |
10 | 260691000696 |
11 | a0616301315 |
12 | 42634a7b760 |
13 | 1b776c874c9 |
14 | c890649000 |
15 | 6bab6bceb6 |
hex | 3cb264fd78 |
260691000696 has 560 divisors, whose sum is σ = 902125038000. Its totient is φ = 70562977632.
The previous prime is 260691000641. The next prime is 260691000721. The reversal of 260691000696 is 696000196062.
It is a powerful number, because all its prime factors have an exponent greater than 1 and also an Achilles number because it is not a perfect power.
It is a taxicab number since it can be written as a sum of two cubes in more than one way. Here 260691000696 = 7983 + 63843 = 35913 + 59853.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 139 ways as a sum of consecutive naturals, for example, 13720578975 + ... + 13720578993.
Almost surely, 2260691000696 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 260691000696, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (451062519000).
260691000696 is an abundant number, since it is smaller than the sum of its proper divisors (641434037304).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
260691000696 is an frugal number, since it uses more digits than its factorization.
260691000696 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 121 (or 31 counting only the distinct ones).
The product of its (nonzero) digits is 209952, while the sum is 45.
The spelling of 260691000696 in words is "two hundred sixty billion, six hundred ninety-one million, six hundred ninety-six", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •