Base | Representation |
---|---|
bin | 110110100000… |
… | …110110110101 |
3 | 222220000200111 |
4 | 312200312311 |
5 | 12124242412 |
6 | 1230143021 |
7 | 232315564 |
oct | 66406665 |
9 | 28800614 |
10 | 14290357 |
11 | 8080614 |
12 | 4951a71 |
13 | 2c64643 |
14 | 1c7dbdb |
15 | 13c42a7 |
hex | da0db5 |
14290357 has 4 divisors (see below), whose sum is σ = 14376096. Its totient is φ = 14204620.
The previous prime is 14290321. The next prime is 14290361. The reversal of 14290357 is 75309241.
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, and also an emirpimes, since its reverse is a distinct semiprime: 75309241 = 7 ⋅10758463.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14290357 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14290307) 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, 42619 + ... + 42952.
It is an arithmetic number, because the mean of its divisors is an integer number (3594024).
Almost surely, 214290357 is an apocalyptic number.
It is an amenable number.
14290357 is a deficient number, since it is larger than the sum of its proper divisors (85739).
14290357 is an equidigital number, since it uses as much as digits as its factorization.
14290357 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 85738.
The product of its (nonzero) digits is 7560, while the sum is 31.
The square root of 14290357 is about 3780.2588535707. The cubic root of 14290357 is about 242.6690329624.
Adding to 14290357 its reverse (75309241), we get a palindrome (89599598).
The spelling of 14290357 in words is "fourteen million, two hundred ninety thousand, three hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •