Base | Representation |
---|---|
bin | 110111000010… |
… | …001100101001 |
3 | 1000010222000102 |
4 | 313002030221 |
5 | 12143130141 |
6 | 1233115145 |
7 | 233424665 |
oct | 67021451 |
9 | 30128012 |
10 | 14426921 |
11 | 8164183 |
12 | 49b8ab5 |
13 | 2cb1852 |
14 | 1cb78a5 |
15 | 13ee99b |
hex | dc2329 |
14426921 has 4 divisors (see below), whose sum is σ = 14438100. Its totient is φ = 14415744.
The previous prime is 14426869. The next prime is 14426933. The reversal of 14426921 is 12962441.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 12962441 = 101 ⋅128341.
It can be written as a sum of positive squares in 2 ways, for example, as 5456896 + 8970025 = 2336^2 + 2995^2 .
It is a cyclic number.
It is not a de Polignac number, because 14426921 - 210 = 14425897 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14422921) 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, 3356 + ... + 6333.
It is an arithmetic number, because the mean of its divisors is an integer number (3609525).
Almost surely, 214426921 is an apocalyptic number.
It is an amenable number.
14426921 is a deficient number, since it is larger than the sum of its proper divisors (11179).
14426921 is an equidigital number, since it uses as much as digits as its factorization.
14426921 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11178.
The product of its digits is 3456, while the sum is 29.
The square root of 14426921 is about 3798.2786890906. The cubic root of 14426921 is about 243.4395955899.
The spelling of 14426921 in words is "fourteen million, four hundred twenty-six thousand, nine hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •