Base | Representation |
---|---|
bin | 11111000010100… |
… | …11111101001000 |
3 | 200010222012221001 |
4 | 33201103331020 |
5 | 1013130000403 |
6 | 41501024344 |
7 | 6311166433 |
oct | 1741237510 |
9 | 603865831 |
10 | 260390728 |
11 | 123a90454 |
12 | 732550b4 |
13 | 41c40070 |
14 | 2682281a |
15 | 17cd7c1d |
hex | f853f48 |
260390728 has 48 divisors (see below), whose sum is σ = 549759420. Its totient is φ = 114930816.
The previous prime is 260390723. The next prime is 260390729. The reversal of 260390728 is 827093062.
It can be written as a sum of positive squares in 2 ways, for example, as 226261764 + 34128964 = 15042^2 + 5842^2 .
It is a Smith number, since the sum of its digits (37) coincides with the sum of the digits of its prime factors.
It is not an unprimeable number, because it can be changed into a prime (260390723) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 52650 + ... + 57382.
Almost surely, 2260390728 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 260390728, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (274879710).
260390728 is an abundant number, since it is smaller than the sum of its proper divisors (289368692).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
260390728 is a wasteful number, since it uses less digits than its factorization.
260390728 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4798 (or 4771 counting only the distinct ones).
The product of its (nonzero) digits is 36288, while the sum is 37.
The square root of 260390728 is about 16136.6269089919. The cubic root of 260390728 is about 638.5699907761.
The spelling of 260390728 in words is "two hundred sixty million, three hundred ninety thousand, seven hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •