Base | Representation |
---|---|
bin | 101110010100101111… |
… | …000011001010000000 |
3 | 11202101110120220022100 |
4 | 232110233003022000 |
5 | 1303331420030140 |
6 | 34503352510400 |
7 | 3410414016600 |
oct | 562457031200 |
9 | 152343526270 |
10 | 49740001920 |
11 | 1a104a30704 |
12 | 97819ab400 |
13 | 48c8c395cb |
14 | 259bdb0c00 |
15 | 1461b38530 |
hex | b94bc3280 |
49740001920 has 1152 divisors, whose sum is σ = 212234256000. Its totient is φ = 10686283776.
The previous prime is 49740001867. The next prime is 49740001931. The reversal of 49740001920 is 2910004794.
It is a tau number, because it is divible by the number of its divisors (1152).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 482912589 + ... + 482912691.
It is an arithmetic number, because the mean of its divisors is an integer number (184231125).
Almost surely, 249740001920 is an apocalyptic number.
49740001920 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 49740001920, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (106117128000).
49740001920 is an abundant number, since it is smaller than the sum of its proper divisors (162494254080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
49740001920 is a wasteful number, since it uses less digits than its factorization.
49740001920 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 230 (or 208 counting only the distinct ones).
The product of its (nonzero) digits is 18144, while the sum is 36.
The spelling of 49740001920 in words is "forty-nine billion, seven hundred forty million, one thousand, nine hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •