Base | Representation |
---|---|
bin | 101001100111111011… |
… | …011010001001010010 |
3 | 11021100202022212110210 |
4 | 221213323122021102 |
5 | 1213012441043134 |
6 | 32310512304550 |
7 | 3141353531403 |
oct | 514773321122 |
9 | 137322285423 |
10 | 44693299794 |
11 | 17a55225700 |
12 | 87b3842156 |
13 | 42a3508730 |
14 | 223da339aa |
15 | 1268a592e9 |
hex | a67eda252 |
44693299794 has 96 divisors (see below), whose sum is σ = 106367450112. Its totient is φ = 12435667200.
The previous prime is 44693299793. The next prime is 44693299799. The reversal of 44693299794 is 49799239644.
It is a Harshad number since it is a multiple of its sum of digits (66).
It is not an unprimeable number, because it can be changed into a prime (44693299793) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1790262 + ... + 1815054.
It is an arithmetic number, because the mean of its divisors is an integer number (1107994272).
Almost surely, 244693299794 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 44693299794, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (53183725056).
44693299794 is an abundant number, since it is smaller than the sum of its proper divisors (61674150318).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
44693299794 is a wasteful number, since it uses less digits than its factorization.
44693299794 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25024 (or 25013 counting only the distinct ones).
The product of its digits is 105815808, while the sum is 66.
The spelling of 44693299794 in words is "forty-four billion, six hundred ninety-three million, two hundred ninety-nine thousand, seven hundred ninety-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •