Base | Representation |
---|---|
bin | 111010011011011… |
… | …000000010011000 |
3 | 2112022112002220000 |
4 | 322123120002120 |
5 | 4001421123442 |
6 | 241134133000 |
7 | 33202012632 |
oct | 7233300230 |
9 | 2468462800 |
10 | 980254872 |
11 | 463367aa3 |
12 | 234351160 |
13 | 128115a8c |
14 | 9428ba52 |
15 | 5b0d0d4c |
hex | 3a6d8098 |
980254872 has 80 divisors (see below), whose sum is σ = 2790744000. Its totient is φ = 321382080.
The previous prime is 980254843. The next prime is 980254883. The reversal of 980254872 is 278452089.
It is a super-2 number, since 2×9802548722 = 1921799228159472768, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 19 ways as a sum of consecutive naturals, for example, 27129 + ... + 51927.
It is an arithmetic number, because the mean of its divisors is an integer number (34884300).
Almost surely, 2980254872 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 980254872, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1395372000).
980254872 is an abundant number, since it is smaller than the sum of its proper divisors (1810489128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
980254872 is a wasteful number, since it uses less digits than its factorization.
980254872 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24878 (or 24865 counting only the distinct ones).
The product of its (nonzero) digits is 322560, while the sum is 45.
The square root of 980254872 is about 31309.0222140520. The cubic root of 980254872 is about 993.3744902345.
The spelling of 980254872 in words is "nine hundred eighty million, two hundred fifty-four thousand, eight hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •