Base | Representation |
---|---|
bin | 110110111011… |
… | …010001100001 |
3 | 1000002112010001 |
4 | 312323101201 |
5 | 12141223221 |
6 | 1232340001 |
7 | 233246212 |
oct | 66732141 |
9 | 30075101 |
10 | 14398561 |
11 | 8144941 |
12 | 49a4601 |
13 | 2ca1978 |
14 | 1cab409 |
15 | 13e6391 |
hex | dbb461 |
14398561 has 4 divisors (see below), whose sum is σ = 15156400. Its totient is φ = 13640724.
The previous prime is 14398547. The next prime is 14398567. The reversal of 14398561 is 16589341.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 14398561 - 221 = 12301409 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 14398561.
It is not an unprimeable number, because it can be changed into a prime (14398567) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 378891 + ... + 378928.
It is an arithmetic number, because the mean of its divisors is an integer number (3789100).
Almost surely, 214398561 is an apocalyptic number.
It is an amenable number.
14398561 is a deficient number, since it is larger than the sum of its proper divisors (757839).
14398561 is an equidigital number, since it uses as much as digits as its factorization.
14398561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 757838.
The product of its digits is 25920, while the sum is 37.
The square root of 14398561 is about 3794.5435825669. The cubic root of 14398561 is about 243.2799755820.
It can be divided in two parts, 1439 and 8561, that added together give a 4-th power (10000 = 104).
The spelling of 14398561 in words is "fourteen million, three hundred ninety-eight thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •