Base | Representation |
---|---|
bin | 1111001000101000011… |
… | …0111010000000000000 |
3 | 220212010220021212001001 |
4 | 3302022012322000000 |
5 | 13230002331312000 |
6 | 315241014021344 |
7 | 24533262626461 |
oct | 3621206720000 |
9 | 825126255031 |
10 | 260015104000 |
11 | a02a9825103 |
12 | 42486647854 |
13 | 1b699c37132 |
14 | c828986d68 |
15 | 6b6c1ac46a |
hex | 3c8a1ba000 |
260015104000 has 224 divisors, whose sum is σ = 669974003712. Its totient is φ = 100638720000.
The previous prime is 260015103977. The next prime is 260015104003. The reversal of 260015104000 is 401510062.
It is not an unprimeable number, because it can be changed into a prime (260015104003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 31739905 + ... + 31748095.
Almost surely, 2260015104000 is an apocalyptic number.
260015104000 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 260015104000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (334987001856).
260015104000 is an abundant number, since it is smaller than the sum of its proper divisors (409958899712).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
260015104000 is an frugal number, since it uses more digits than its factorization.
260015104000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8263 (or 8229 counting only the distinct ones).
The product of its (nonzero) digits is 240, while the sum is 19.
Adding to 260015104000 its reverse (401510062), we get a palindrome (260416614062).
The spelling of 260015104000 in words is "two hundred sixty billion, fifteen million, one hundred four thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •