Base | Representation |
---|---|
bin | 110110010111… |
… | …101010100001 |
3 | 222211010000222 |
4 | 312113222201 |
5 | 12122041310 |
6 | 1225252425 |
7 | 232101035 |
oct | 66275241 |
9 | 28733028 |
10 | 14252705 |
11 | 80552a5 |
12 | 4934115 |
13 | 2c5046c |
14 | 1c701c5 |
15 | 13b8055 |
hex | d97aa1 |
14252705 has 4 divisors (see below), whose sum is σ = 17103252. Its totient is φ = 11402160.
The previous prime is 14252701. The next prime is 14252747. The reversal of 14252705 is 50725241.
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 6345361 + 7907344 = 2519^2 + 2812^2 .
It is not a de Polignac number, because 14252705 - 22 = 14252701 is a prime.
It is a super-3 number, since 3×142527053 (a number of 22 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14252701) 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, 1425266 + ... + 1425275.
It is an arithmetic number, because the mean of its divisors is an integer number (4275813).
Almost surely, 214252705 is an apocalyptic number.
It is an amenable number.
14252705 is a deficient number, since it is larger than the sum of its proper divisors (2850547).
14252705 is an equidigital number, since it uses as much as digits as its factorization.
14252705 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2850546.
The product of its (nonzero) digits is 2800, while the sum is 26.
The square root of 14252705 is about 3775.2754866367. The cubic root of 14252705 is about 242.4557187010.
Adding to 14252705 its reverse (50725241), we get a palindrome (64977946).
The spelling of 14252705 in words is "fourteen million, two hundred fifty-two thousand, seven hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •