Base | Representation |
---|---|
bin | 1110110001011… |
… | …0011011011000 |
3 | 11022120210012010 |
4 | 3230112123120 |
5 | 111330122343 |
6 | 10051545520 |
7 | 1351430061 |
oct | 354263330 |
9 | 138523163 |
10 | 61957848 |
11 | 31a78937 |
12 | 188bb2a0 |
13 | cab4164 |
14 | 832b568 |
15 | 568cd33 |
hex | 3b166d8 |
61957848 has 64 divisors (see below), whose sum is σ = 160392960. Its totient is φ = 19933056.
The previous prime is 61957823. The next prime is 61957849. The reversal of 61957848 is 84875916.
It is a super-2 number, since 2×619578482 = 7677549857582208, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 61957797 and 61957806.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (61957849) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 84861 + ... + 85587.
It is an arithmetic number, because the mean of its divisors is an integer number (2506140).
Almost surely, 261957848 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 61957848, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (80196480).
61957848 is an abundant number, since it is smaller than the sum of its proper divisors (98435112).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
61957848 is a wasteful number, since it uses less digits than its factorization.
61957848 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 856 (or 852 counting only the distinct ones).
The product of its digits is 483840, while the sum is 48.
The square root of 61957848 is about 7871.3307642355. The cubic root of 61957848 is about 395.6994454467.
The spelling of 61957848 in words is "sixty-one million, nine hundred fifty-seven thousand, eight hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •