Base | Representation |
---|---|
bin | 110101100000… |
… | …001100010101 |
3 | 222101120100201 |
4 | 311200030111 |
5 | 12042303433 |
6 | 1220340501 |
7 | 230133436 |
oct | 65401425 |
9 | 28346321 |
10 | 14025493 |
11 | 7a0a619 |
12 | 4844731 |
13 | 2ba0c11 |
14 | 1c1148d |
15 | 1370a7d |
hex | d60315 |
14025493 has 4 divisors (see below), whose sum is σ = 14850540. Its totient is φ = 13200448.
The previous prime is 14025467. The next prime is 14025511. The reversal of 14025493 is 39452041.
14025493 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 39452041 = 3257 ⋅12113.
It can be written as a sum of positive squares in 2 ways, for example, as 4334724 + 9690769 = 2082^2 + 3113^2 .
It is a cyclic number.
It is not a de Polignac number, because 14025493 - 29 = 14024981 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 (14025433) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 412498 + ... + 412531.
It is an arithmetic number, because the mean of its divisors is an integer number (3712635).
Almost surely, 214025493 is an apocalyptic number.
It is an amenable number.
14025493 is a deficient number, since it is larger than the sum of its proper divisors (825047).
14025493 is an equidigital number, since it uses as much as digits as its factorization.
14025493 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 825046.
The product of its (nonzero) digits is 4320, while the sum is 28.
The square root of 14025493 is about 3745.0624827898. The cubic root of 14025493 is about 241.1604276098.
The spelling of 14025493 in words is "fourteen million, twenty-five thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.025 sec. • engine limits •