Base | Representation |
---|---|
bin | 101110011000001100… |
… | …101000010000000000 |
3 | 11202112111212221222210 |
4 | 232120030220100000 |
5 | 1303441302301210 |
6 | 34513225502120 |
7 | 3412020522045 |
oct | 563014502000 |
9 | 152474787883 |
10 | 49798087680 |
11 | 1a1347a4370 |
12 | 9799341940 |
13 | 4907c96193 |
14 | 25a59b11cc |
15 | 1466cade20 |
hex | b98328400 |
49798087680 has 704 divisors, whose sum is σ = 181841200128. Its totient is φ = 11527127040.
The previous prime is 49798087679. The next prime is 49798087693. The reversal of 49798087680 is 8678089794.
It is a tau number, because it is divible by the number of its divisors (704).
It is a Harshad number since it is a multiple of its sum of digits (66).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 599976919 + ... + 599977001.
Almost surely, 249798087680 is an apocalyptic number.
49798087680 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 49798087680, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (90920600064).
49798087680 is an abundant number, since it is smaller than the sum of its proper divisors (132043112448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
49798087680 is a wasteful number, since it uses less digits than its factorization.
49798087680 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 242 (or 224 counting only the distinct ones).
The product of its (nonzero) digits is 48771072, while the sum is 66.
The spelling of 49798087680 in words is "forty-nine billion, seven hundred ninety-eight million, eighty-seven thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •