Base | Representation |
---|---|
bin | 110101111100… |
… | …001110100001 |
3 | 222121101212121 |
4 | 311330032201 |
5 | 12104442241 |
6 | 1223024241 |
7 | 231122266 |
oct | 65741641 |
9 | 28541777 |
10 | 14140321 |
11 | 7a88918 |
12 | 489b081 |
13 | 2c11270 |
14 | 1c4126d |
15 | 1394ad1 |
hex | d7c3a1 |
14140321 has 4 divisors (see below), whose sum is σ = 15228052. Its totient is φ = 13052592.
The previous prime is 14140297. The next prime is 14140339. The reversal of 14140321 is 12304141.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 3381921 + 10758400 = 1839^2 + 3280^2 .
It is a cyclic number.
It is not a de Polignac number, because 14140321 - 215 = 14107553 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 14140295 and 14140304.
It is not an unprimeable number, because it can be changed into a prime (14140361) 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, 543846 + ... + 543871.
It is an arithmetic number, because the mean of its divisors is an integer number (3807013).
Almost surely, 214140321 is an apocalyptic number.
It is an amenable number.
14140321 is a deficient number, since it is larger than the sum of its proper divisors (1087731).
14140321 is a wasteful number, since it uses less digits than its factorization.
14140321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1087730.
The product of its (nonzero) digits is 96, while the sum is 16.
The square root of 14140321 is about 3760.3618176979. The cubic root of 14140321 is about 241.8167738600.
Adding to 14140321 its reverse (12304141), we get a palindrome (26444462).
The spelling of 14140321 in words is "fourteen million, one hundred forty thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •