Base | Representation |
---|---|
bin | 1110110000100… |
… | …1000000000000 |
3 | 11022110222202002 |
4 | 3230021000000 |
5 | 111321342343 |
6 | 10050443132 |
7 | 1351110530 |
oct | 354110000 |
9 | 138428662 |
10 | 61902848 |
11 | 31a40587 |
12 | 188934a8 |
13 | ca95107 |
14 | 83154c0 |
15 | 567b8b8 |
hex | 3b09000 |
61902848 has 104 divisors (see below), whose sum is σ = 150976512. Its totient is φ = 24772608.
The previous prime is 61902847. The next prime is 61902857. The reversal of 61902848 is 84820916.
It is a super-2 number, since 2×619028482 = 7663925181022208, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (61902847) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 487361 + ... + 487487.
Almost surely, 261902848 is an apocalyptic number.
61902848 is a gapful number since it is divisible by the number (68) 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 61902848, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (75488256).
61902848 is an abundant number, since it is smaller than the sum of its proper divisors (89073664).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
61902848 is a wasteful number, since it uses less digits than its factorization.
61902848 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 175 (or 153 counting only the distinct ones).
The product of its (nonzero) digits is 27648, while the sum is 38.
The square root of 61902848 is about 7867.8362972294. The cubic root of 61902848 is about 395.5823232784.
The spelling of 61902848 in words is "sixty-one million, nine hundred two thousand, eight hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •