Base | Representation |
---|---|
bin | 110101100001… |
… | …110010101101 |
3 | 222101220100101 |
4 | 311201302231 |
5 | 12043011140 |
6 | 1220431101 |
7 | 230161516 |
oct | 65416255 |
9 | 28356311 |
10 | 14032045 |
11 | 7a14535 |
12 | 4848491 |
13 | 2ba3bb1 |
14 | 1c13a0d |
15 | 137299a |
hex | d61cad |
14032045 has 8 divisors (see below), whose sum is σ = 17249400. Its totient is φ = 10951680.
The previous prime is 14032043. The next prime is 14032069. The reversal of 14032045 is 54023041.
14032045 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 702244 + 13329801 = 838^2 + 3651^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 14032045 - 21 = 14032043 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14032043) 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 7 ways as a sum of consecutive naturals, for example, 34020 + ... + 34429.
It is an arithmetic number, because the mean of its divisors is an integer number (2156175).
Almost surely, 214032045 is an apocalyptic number.
It is an amenable number.
14032045 is a deficient number, since it is larger than the sum of its proper divisors (3217355).
14032045 is an equidigital number, since it uses as much as digits as its factorization.
14032045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68495.
The product of its (nonzero) digits is 480, while the sum is 19.
The square root of 14032045 is about 3745.9371324143. The cubic root of 14032045 is about 241.1979744097.
Adding to 14032045 its reverse (54023041), we get a palindrome (68055086).
The spelling of 14032045 in words is "fourteen million, thirty-two thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •