Base | Representation |
---|---|
bin | 11111000110101… |
… | …01001011100000 |
3 | 200011222002222220 |
4 | 33203111023200 |
5 | 1013243420112 |
6 | 41520231040 |
7 | 6315532542 |
oct | 1743251340 |
9 | 604862886 |
10 | 260920032 |
11 | 12431209a |
12 | 7346b480 |
13 | 42096c69 |
14 | 2691d692 |
15 | 17d8e98c |
hex | f8d52e0 |
260920032 has 48 divisors (see below), whose sum is σ = 685761552. Its totient is φ = 86865920.
The previous prime is 260920019. The next prime is 260920061. The reversal of 260920032 is 230029062.
260920032 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (48).
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a junction number, because it is equal to n+sod(n) for n = 260919984 and 260920011.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 129658 + ... + 131654.
It is an arithmetic number, because the mean of its divisors is an integer number (14286699).
Almost surely, 2260920032 is an apocalyptic number.
It is an amenable number.
260920032 is an abundant number, since it is smaller than the sum of its proper divisors (424841520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
260920032 is a wasteful number, since it uses less digits than its factorization.
260920032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3371 (or 3363 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 24.
The square root of 260920032 is about 16153.0192843320. The cubic root of 260920032 is about 639.0023780222.
Adding to 260920032 its reverse (230029062), we get a palindrome (490949094).
The spelling of 260920032 in words is "two hundred sixty million, nine hundred twenty thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •