Base | Representation |
---|---|
bin | 101110100001101011… |
… | …010001010010100000 |
3 | 11202221121010101112000 |
4 | 232201223101102200 |
5 | 1304303010140130 |
6 | 34541110204000 |
7 | 3415661320500 |
oct | 564153212240 |
9 | 152847111460 |
10 | 49957115040 |
11 | 1a206541a38 |
12 | 9822653600 |
13 | 4931c06001 |
14 | 25bcb69a00 |
15 | 1475c23260 |
hex | ba1ad14a0 |
49957115040 has 1152 divisors, whose sum is σ = 219748515840. Its totient is φ = 10538035200.
The previous prime is 49957115003. The next prime is 49957115051. The reversal of 49957115040 is 4051175994.
49957115040 is a `hidden beast` number, since 4 + 99 + 57 + 1 + 1 + 504 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is an unprimeable number.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 150927675 + ... + 150928005.
It is an arithmetic number, because the mean of its divisors is an integer number (190753920).
Almost surely, 249957115040 is an apocalyptic number.
49957115040 is a gapful number since it is divisible by the number (40) 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 49957115040, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (109874257920).
49957115040 is an abundant number, since it is smaller than the sum of its proper divisors (169791400800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
49957115040 is a wasteful number, since it uses less digits than its factorization.
49957115040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 423 (or 402 counting only the distinct ones).
The product of its (nonzero) digits is 226800, while the sum is 45.
The spelling of 49957115040 in words is "forty-nine billion, nine hundred fifty-seven million, one hundred fifteen thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •