Base | Representation |
---|---|
bin | 101001001100000010… |
… | …111001001101101110 |
3 | 11020011011002011211000 |
4 | 221030002321031232 |
5 | 1211033212000024 |
6 | 32152241541130 |
7 | 3123643355553 |
oct | 511402711556 |
9 | 136134064730 |
10 | 44225500014 |
11 | 17835161813 |
12 | 86a30447a6 |
13 | 422a618c27 |
14 | 21d7860a2a |
15 | 123c951cc9 |
hex | a4c0b936e |
44225500014 has 64 divisors (see below), whose sum is σ = 100011744000. Its totient is φ = 14482242720.
The previous prime is 44225500013. The next prime is 44225500019. The reversal of 44225500014 is 41000552244.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (44225500013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5925417 + ... + 5932875.
It is an arithmetic number, because the mean of its divisors is an integer number (1562683500).
Almost surely, 244225500014 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 44225500014, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (50005872000).
44225500014 is an abundant number, since it is smaller than the sum of its proper divisors (55786243986).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
44225500014 is a wasteful number, since it uses less digits than its factorization.
44225500014 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9390 (or 9384 counting only the distinct ones).
The product of its (nonzero) digits is 6400, while the sum is 27.
The spelling of 44225500014 in words is "forty-four billion, two hundred twenty-five million, five hundred thousand, fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •