Base | Representation |
---|---|
bin | 101001010111001110… |
… | …100001110110000000 |
3 | 11020122020002012210010 |
4 | 221113032201312000 |
5 | 1211424223140032 |
6 | 32223022504520 |
7 | 3131412054534 |
oct | 512716416600 |
9 | 136566065703 |
10 | 44413099392 |
11 | 17921044a22 |
12 | 8735a35140 |
13 | 425a450a8c |
14 | 2214735bc4 |
15 | 124e15bccc |
hex | a573a1d80 |
44413099392 has 128 divisors (see below), whose sum is σ = 118752480000. Its totient is φ = 14706857984.
The previous prime is 44413099391. The next prime is 44413099399. The reversal of 44413099392 is 29399031444.
It is a tau number, because it is divible by the number of its divisors (128).
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (44413099391) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 67394359 + ... + 67395017.
It is an arithmetic number, because the mean of its divisors is an integer number (927753750).
Almost surely, 244413099392 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 44413099392, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (59376240000).
44413099392 is an abundant number, since it is smaller than the sum of its proper divisors (74339380608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
44413099392 is a wasteful number, since it uses less digits than its factorization.
44413099392 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1568 (or 1556 counting only the distinct ones).
The product of its (nonzero) digits is 839808, while the sum is 48.
The spelling of 44413099392 in words is "forty-four billion, four hundred thirteen million, ninety-nine thousand, three hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •