Base | Representation |
---|---|
bin | 110100101010… |
… | …110111010001 |
3 | 221222110201111 |
4 | 310222313101 |
5 | 12013311212 |
6 | 1211533321 |
7 | 225233545 |
oct | 64526721 |
9 | 27873644 |
10 | 13807057 |
11 | 78804a0 |
12 | 475a241 |
13 | 2b25674 |
14 | 1b95a25 |
15 | 132aea7 |
hex | d2add1 |
13807057 has 4 divisors (see below), whose sum is σ = 15062256. Its totient is φ = 12551860.
The previous prime is 13807019. The next prime is 13807063. The reversal of 13807057 is 75070831.
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 not a de Polignac number, because 13807057 - 211 = 13805009 is a prime.
It is a Smith number, since the sum of its digits (31) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is not an unprimeable number, because it can be changed into a prime (13807657) 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, 627583 + ... + 627604.
It is an arithmetic number, because the mean of its divisors is an integer number (3765564).
Almost surely, 213807057 is an apocalyptic number.
It is an amenable number.
13807057 is a deficient number, since it is larger than the sum of its proper divisors (1255199).
13807057 is a wasteful number, since it uses less digits than its factorization.
13807057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1255198.
The product of its (nonzero) digits is 5880, while the sum is 31.
The square root of 13807057 is about 3715.7848430715. The cubic root of 13807057 is about 239.9019101469.
Adding to 13807057 its reverse (75070831), we get a palindrome (88877888).
The spelling of 13807057 in words is "thirteen million, eight hundred seven thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •