Base | Representation |
---|---|
bin | 110100011011… |
… | …001010001011 |
3 | 221212012111001 |
4 | 310123022023 |
5 | 12004231411 |
6 | 1210315431 |
7 | 224545162 |
oct | 64331213 |
9 | 27765431 |
10 | 13742731 |
11 | 7837132 |
12 | 4728b77 |
13 | 2b022c2 |
14 | 1b7a3d9 |
15 | 1316dc1 |
hex | d1b28b |
13742731 has 2 divisors, whose sum is σ = 13742732. Its totient is φ = 13742730.
The previous prime is 13742713. The next prime is 13742737. The reversal of 13742731 is 13724731.
13742731 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
Together with previous prime (13742713) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is an emirp because it is prime and its reverse (13724731) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13742731 - 25 = 13742699 is a prime.
It is a super-2 number, since 2×137427312 = 377725310676722, which contains 22 as substring.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13742731.
It is not a weakly prime, because it can be changed into another prime (13742737) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6871365 + 6871366.
It is an arithmetic number, because the mean of its divisors is an integer number (6871366).
Almost surely, 213742731 is an apocalyptic number.
13742731 is a deficient number, since it is larger than the sum of its proper divisors (1).
13742731 is an equidigital number, since it uses as much as digits as its factorization.
13742731 is an evil number, because the sum of its binary digits is even.
The product of its digits is 3528, while the sum is 28.
The square root of 13742731 is about 3707.1189622131. The cubic root of 13742731 is about 239.5287686468.
The spelling of 13742731 in words is "thirteen million, seven hundred forty-two thousand, seven hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •