Base | Representation |
---|---|
bin | 110111000000… |
… | …100000110111 |
3 | 1000010121112221 |
4 | 313000200313 |
5 | 12142420043 |
6 | 1233023211 |
7 | 233365612 |
oct | 67004067 |
9 | 30117487 |
10 | 14420023 |
11 | 8159a82 |
12 | 49b4b07 |
13 | 2cab677 |
14 | 1cb5179 |
15 | 13ec8ed |
hex | dc0837 |
14420023 has 4 divisors (see below), whose sum is σ = 14726880. Its totient is φ = 14113168.
The previous prime is 14420017. The next prime is 14420059. The reversal of 14420023 is 32002441.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 14420023 - 29 = 14419511 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 14419979 and 14420006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14420083) 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 3 ways as a sum of consecutive naturals, for example, 153358 + ... + 153451.
It is an arithmetic number, because the mean of its divisors is an integer number (3681720).
Almost surely, 214420023 is an apocalyptic number.
14420023 is a deficient number, since it is larger than the sum of its proper divisors (306857).
14420023 is an equidigital number, since it uses as much as digits as its factorization.
14420023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 306856.
The product of its (nonzero) digits is 192, while the sum is 16.
The square root of 14420023 is about 3797.3705376221. The cubic root of 14420023 is about 243.4007904969.
Adding to 14420023 its reverse (32002441), we get a palindrome (46422464).
It can be divided in two parts, 144200 and 23, that multiplied together give a triangular number (3316600 = T2575).
The spelling of 14420023 in words is "fourteen million, four hundred twenty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •