Base | Representation |
---|---|
bin | 10000111100000010011111 |
3 | 22100120211201 |
4 | 100330002133 |
5 | 2114041343 |
6 | 235100331 |
7 | 52512154 |
oct | 20740237 |
9 | 8316751 |
10 | 4440223 |
11 | 2563007 |
12 | 15a16a7 |
13 | bc6068 |
14 | 83822b |
15 | 5ca94d |
hex | 43c09f |
4440223 has 8 divisors (see below), whose sum is σ = 4691456. Its totient is φ = 4195800.
The previous prime is 4440221. The next prime is 4440239. The reversal of 4440223 is 3220444.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 4440223 - 21 = 4440221 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 4440223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4440221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 333 + ... + 2998.
It is an arithmetic number, because the mean of its divisors is an integer number (586432).
Almost surely, 24440223 is an apocalyptic number.
4440223 is a gapful number since it is divisible by the number (43) formed by its first and last digit.
4440223 is the 1333-rd heptagonal number.
4440223 is a deficient number, since it is larger than the sum of its proper divisors (251233).
4440223 is a wasteful number, since it uses less digits than its factorization.
4440223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3405.
The product of its (nonzero) digits is 768, while the sum is 19.
The square root of 4440223 is about 2107.1836654644. The cubic root of 4440223 is about 164.3620669127.
Adding to 4440223 its reverse (3220444), we get a palindrome (7660667).
The spelling of 4440223 in words is "four million, four hundred forty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •