Base | Representation |
---|---|
bin | 110100011011… |
… | …001000011111 |
3 | 221212012100001 |
4 | 310123020133 |
5 | 12004230443 |
6 | 1210315131 |
7 | 224544646 |
oct | 64331037 |
9 | 27765301 |
10 | 13742623 |
11 | 7837044 |
12 | 4728aa7 |
13 | 2b0223b |
14 | 1b7a35d |
15 | 1316d4d |
hex | d1b21f |
13742623 has 2 divisors, whose sum is σ = 13742624. Its totient is φ = 13742622.
The previous prime is 13742609. The next prime is 13742627. The reversal of 13742623 is 32624731.
13742623 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is an emirp because it is prime and its reverse (32624731) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13742623 - 25 = 13742591 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13742591 and 13742600.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13742627) 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 as a sum of consecutive naturals, namely, 6871311 + 6871312.
It is an arithmetic number, because the mean of its divisors is an integer number (6871312).
Almost surely, 213742623 is an apocalyptic number.
13742623 is a deficient number, since it is larger than the sum of its proper divisors (1).
13742623 is an equidigital number, since it uses as much as digits as its factorization.
13742623 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 6048, while the sum is 28.
The square root of 13742623 is about 3707.1043956166. The cubic root of 13742623 is about 239.5281411836.
It can be divided in two parts, 13742 and 623, that added together give a triangular number (14365 = T169).
The spelling of 13742623 in words is "thirteen million, seven hundred forty-two thousand, six hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •