Base | Representation |
---|---|
bin | 110110111011… |
… | …000110010001 |
3 | 1000002111010101 |
4 | 312323012101 |
5 | 12141212331 |
6 | 1232332401 |
7 | 233244133 |
oct | 66730621 |
9 | 30074111 |
10 | 14397841 |
11 | 8144347 |
12 | 49a4101 |
13 | 2ca1543 |
14 | 1cab053 |
15 | 13e6061 |
hex | dbb191 |
14397841 has 2 divisors, whose sum is σ = 14397842. Its totient is φ = 14397840.
The previous prime is 14397809. The next prime is 14397869. The reversal of 14397841 is 14879341.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13476241 + 921600 = 3671^2 + 960^2 .
It is an emirp because it is prime and its reverse (14879341) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 14397841 - 25 = 14397809 is a prime.
It is a super-2 number, since 2×143978412 = 414595650922562, which contains 22 as substring.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 14397841.
It is not a weakly prime, because it can be changed into another prime (14397871) 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 as a sum of consecutive naturals, namely, 7198920 + 7198921.
It is an arithmetic number, because the mean of its divisors is an integer number (7198921).
Almost surely, 214397841 is an apocalyptic number.
It is an amenable number.
14397841 is a deficient number, since it is larger than the sum of its proper divisors (1).
14397841 is an equidigital number, since it uses as much as digits as its factorization.
14397841 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 24192, while the sum is 37.
The square root of 14397841 is about 3794.4487083106. The cubic root of 14397841 is about 243.2759204429.
The spelling of 14397841 in words is "fourteen million, three hundred ninety-seven thousand, eight hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •