Base | Representation |
---|---|
bin | 11010011010110… |
… | …001011110111010 |
3 | 1010220000012211100 |
4 | 122122301132322 |
5 | 1401431213132 |
6 | 111551512230 |
7 | 13661234130 |
oct | 3232613672 |
9 | 1126005740 |
10 | 443226042 |
11 | 20820a316 |
12 | 104528676 |
13 | 70a9763c |
14 | 42c17750 |
15 | 28da137c |
hex | 1a6b17ba |
443226042 has 48 divisors (see below), whose sum is σ = 1099238400. Its totient is φ = 126436896.
The previous prime is 443226041. The next prime is 443226073. The reversal of 443226042 is 240622344.
It is a junction number, because it is equal to n+sod(n) for n = 443225997 and 443226015.
It is not an unprimeable number, because it can be changed into a prime (443226041) 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 23 ways as a sum of consecutive naturals, for example, 89959 + ... + 94757.
It is an arithmetic number, because the mean of its divisors is an integer number (22900800).
Almost surely, 2443226042 is an apocalyptic number.
443226042 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
443226042 is an abundant number, since it is smaller than the sum of its proper divisors (656012358).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
443226042 is a wasteful number, since it uses less digits than its factorization.
443226042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5547 (or 5544 counting only the distinct ones).
The product of its (nonzero) digits is 9216, while the sum is 27.
The square root of 443226042 is about 21052.9342847975. The cubic root of 443226042 is about 762.4448288309. Note that the first 3 decimals are identical.
Adding to 443226042 its reverse (240622344), we get a palindrome (683848386).
The spelling of 443226042 in words is "four hundred forty-three million, two hundred twenty-six thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •