Base | Representation |
---|---|
bin | 10110010011010000100101… |
… | …01101011001000111100100 |
3 | 20102122012110101002211020102 |
4 | 23021220102231121013210 |
5 | 22411433413110144410 |
6 | 252144440254123232 |
7 | 13221020060153462 |
oct | 1311502255310744 |
9 | 212565411084212 |
10 | 49040250474980 |
11 | 14697942a09856 |
12 | 56003b47b0518 |
13 | 214962538764b |
14 | c177bcb2d832 |
15 | 5a09b1daa2a5 |
hex | 2c9a12b591e4 |
49040250474980 has 96 divisors (see below), whose sum is σ = 109083198631680. Its totient is φ = 18480267970560.
The previous prime is 49040250474973. The next prime is 49040250475019. The reversal of 49040250474980 is 8947405204094.
It is a happy number.
It is a super-2 number, since 2×490402504749802 (a number of 28 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 200855216 + ... + 201099224.
It is an arithmetic number, because the mean of its divisors is an integer number (1136283319080).
Almost surely, 249040250474980 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 49040250474980, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (54541599315840).
49040250474980 is an abundant number, since it is smaller than the sum of its proper divisors (60042948156700).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
49040250474980 is a wasteful number, since it uses less digits than its factorization.
49040250474980 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 250629 (or 250627 counting only the distinct ones).
The product of its (nonzero) digits is 11612160, while the sum is 56.
The spelling of 49040250474980 in words is "forty-nine trillion, forty billion, two hundred fifty million, four hundred seventy-four thousand, nine hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •