Base | Representation |
---|---|
bin | 110100011000… |
… | …010101111001 |
3 | 221211121122201 |
4 | 310120111321 |
5 | 12003344233 |
6 | 1210150201 |
7 | 224466430 |
oct | 64302571 |
9 | 27747581 |
10 | 13731193 |
11 | 78294a3 |
12 | 4722361 |
13 | 2ac9c88 |
14 | 1b76117 |
15 | 131377d |
hex | d18579 |
13731193 has 8 divisors (see below), whose sum is σ = 15717888. Its totient is φ = 11750784.
The previous prime is 13731173. The next prime is 13731197. The reversal of 13731193 is 39113731.
13731193 is digitally balanced in base 2 and base 8, because in such bases it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13731193 - 221 = 11634041 is a prime.
It is a super-2 number, since 2×137311932 = 377091322406498, which contains 22 as substring.
It is a Duffinian number.
13731193 is strictly pandigital in base 8.
It is not an unprimeable number, because it can be changed into a prime (13731197) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4905 + ... + 7177.
It is an arithmetic number, because the mean of its divisors is an integer number (1964736).
Almost surely, 213731193 is an apocalyptic number.
It is an amenable number.
13731193 is a deficient number, since it is larger than the sum of its proper divisors (1986695).
13731193 is an equidigital number, since it uses as much as digits as its factorization.
13731193 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3143.
The product of its digits is 1701, while the sum is 28.
The square root of 13731193 is about 3705.5624404400. The cubic root of 13731193 is about 239.4617160663.
It can be divided in two parts, 13731 and 193, that added together give a square (13924 = 1182).
The spelling of 13731193 in words is "thirteen million, seven hundred thirty-one thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •