Base | Representation |
---|---|
bin | 1010101100101… |
… | …1010011110110 |
3 | 10010102210010010 |
4 | 2223023103312 |
5 | 42441413300 |
6 | 4241441050 |
7 | 1053261633 |
oct | 253132366 |
9 | 103383103 |
10 | 44872950 |
11 | 23369791 |
12 | 13040186 |
13 | 93b1855 |
14 | 5d6118a |
15 | 3e15a50 |
hex | 2acb4f6 |
44872950 has 48 divisors (see below), whose sum is σ = 111774096. Its totient is φ = 11913600.
The previous prime is 44872943. The next prime is 44872957. The reversal of 44872950 is 5927844.
It is an interprime number because it is at equal distance from previous prime (44872943) and next prime (44872957).
It is a junction number, because it is equal to n+sod(n) for n = 44872899 and 44872908.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (44872957) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 43440 + ... + 44460.
It is an arithmetic number, because the mean of its divisors is an integer number (2328627).
Almost surely, 244872950 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 44872950, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (55887048).
44872950 is an abundant number, since it is smaller than the sum of its proper divisors (66901146).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
44872950 is a wasteful number, since it uses less digits than its factorization.
44872950 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1329 (or 1324 counting only the distinct ones).
The product of its (nonzero) digits is 80640, while the sum is 39.
The square root of 44872950 is about 6698.7274910986. The cubic root of 44872950 is about 355.3542717424.
The spelling of 44872950 in words is "forty-four million, eight hundred seventy-two thousand, nine hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •