Base | Representation |
---|---|
bin | 1010100110000… |
… | …1100111010110 |
3 | 10002121210020202 |
4 | 2221201213112 |
5 | 42334040042 |
6 | 4224300502 |
7 | 1046506514 |
oct | 251414726 |
9 | 102553222 |
10 | 44440022 |
11 | 230a34a0 |
12 | 12a71732 |
13 | 928c793 |
14 | 5c8b4b4 |
15 | 3d7c632 |
hex | 2a619d6 |
44440022 has 8 divisors (see below), whose sum is σ = 72720072. Its totient is φ = 20200000.
The previous prime is 44440007. The next prime is 44440037. The reversal of 44440022 is 22004444.
44440022 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (44440007) and next prime (44440037).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a zygodrome in base 10.
It is a junction number, because it is equal to n+sod(n) for n = 44439976 and 44440003.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1009979 + ... + 1010022.
It is an arithmetic number, because the mean of its divisors is an integer number (9090009).
Almost surely, 244440022 is an apocalyptic number.
44440022 is a deficient number, since it is larger than the sum of its proper divisors (28280050).
44440022 is a wasteful number, since it uses less digits than its factorization.
44440022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2020014.
The product of its (nonzero) digits is 1024, while the sum is 20.
The square root of 44440022 is about 6666.3349750819. The cubic root of 44440022 is about 354.2077737999.
Adding to 44440022 its reverse (22004444), we get a palindrome (66444466).
The spelling of 44440022 in words is "forty-four million, four hundred forty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •