Base | Representation |
---|---|
bin | 110101111011… |
… | …000011000101 |
3 | 222121011020210 |
4 | 311323003011 |
5 | 12104313433 |
6 | 1222550033 |
7 | 231102231 |
oct | 65730305 |
9 | 28534223 |
10 | 14135493 |
11 | 7a85229 |
12 | 4898319 |
13 | 2c0bcc8 |
14 | 1c3d5c1 |
15 | 1393463 |
hex | d7b0c5 |
14135493 has 4 divisors (see below), whose sum is σ = 18847328. Its totient is φ = 9423660.
The previous prime is 14135479. The next prime is 14135497. The reversal of 14135493 is 39453141.
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.
It is not a de Polignac number, because 14135493 - 24 = 14135477 is a prime.
It is a super-3 number, since 3×141354933 (a number of 22 digits) contains 333 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 14135493.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14135497) 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, 2355913 + ... + 2355918.
It is an arithmetic number, because the mean of its divisors is an integer number (4711832).
Almost surely, 214135493 is an apocalyptic number.
It is an amenable number.
14135493 is a deficient number, since it is larger than the sum of its proper divisors (4711835).
14135493 is an equidigital number, since it uses as much as digits as its factorization.
14135493 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4711834.
The product of its digits is 6480, while the sum is 30.
The square root of 14135493 is about 3759.7198033896. The cubic root of 14135493 is about 241.7892491599.
The spelling of 14135493 in words is "fourteen million, one hundred thirty-five thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •