Base | Representation |
---|---|
bin | 110100011011… |
… | …001000111101 |
3 | 221212012101011 |
4 | 310123020331 |
5 | 12004231103 |
6 | 1210315221 |
7 | 224545021 |
oct | 64331075 |
9 | 27765334 |
10 | 13742653 |
11 | 7837071 |
12 | 4728b11 |
13 | 2b02262 |
14 | 1b7a381 |
15 | 1316d6d |
hex | d1b23d |
13742653 has 4 divisors (see below), whose sum is σ = 13771360. Its totient is φ = 13713948.
The previous prime is 13742639. The next prime is 13742657. The reversal of 13742653 is 35624731.
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 a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13742653 is a prime.
It is a super-3 number, since 3×137426533 (a number of 22 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13742657) 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, 13623 + ... + 14596.
It is an arithmetic number, because the mean of its divisors is an integer number (3442840).
Almost surely, 213742653 is an apocalyptic number.
It is an amenable number.
13742653 is a deficient number, since it is larger than the sum of its proper divisors (28707).
13742653 is an equidigital number, since it uses as much as digits as its factorization.
13742653 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28706.
The product of its digits is 15120, while the sum is 31.
The square root of 13742653 is about 3707.1084418992. The cubic root of 13742653 is about 239.5283154793.
The spelling of 13742653 in words is "thirteen million, seven hundred forty-two thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.023 sec. • engine limits •