Base | Representation |
---|---|
bin | 11010011110100… |
… | …010101100000111 |
3 | 1010221212102002020 |
4 | 122132202230013 |
5 | 1402204322043 |
6 | 112025014223 |
7 | 14002520421 |
oct | 3236425407 |
9 | 1127772066 |
10 | 444214023 |
11 | 208824630 |
12 | 104924373 |
13 | 71052246 |
14 | 42dd3811 |
15 | 28ee8e83 |
hex | 1a7a2b07 |
444214023 has 8 divisors (see below), whose sum is σ = 646129536. Its totient is φ = 269220600.
The previous prime is 444214007. The next prime is 444214033. The reversal of 444214023 is 320412444.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 444214023 - 24 = 444214007 is a prime.
It is a Smith number, since the sum of its digits (24) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a junction number, because it is equal to n+sod(n) for n = 444213984 and 444214002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (444214033) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6730483 + ... + 6730548.
It is an arithmetic number, because the mean of its divisors is an integer number (80766192).
Almost surely, 2444214023 is an apocalyptic number.
444214023 is a deficient number, since it is larger than the sum of its proper divisors (201915513).
444214023 is a wasteful number, since it uses less digits than its factorization.
444214023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13461045.
The product of its (nonzero) digits is 3072, while the sum is 24.
The square root of 444214023 is about 21076.3854348890. The cubic root of 444214023 is about 763.0109222161.
Adding to 444214023 its reverse (320412444), we get a palindrome (764626467).
The spelling of 444214023 in words is "four hundred forty-four million, two hundred fourteen thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •