Base | Representation |
---|---|
bin | 100100110101001101101 |
3 | 2021022112202 |
4 | 10212221231 |
5 | 302110033 |
6 | 41511245 |
7 | 13154432 |
oct | 4465155 |
9 | 2238482 |
10 | 1206893 |
11 | 754836 |
12 | 4a2525 |
13 | 33344c |
14 | 235b89 |
15 | 18c8e8 |
hex | 126a6d |
1206893 has 4 divisors (see below), whose sum is σ = 1248540. Its totient is φ = 1165248.
The previous prime is 1206869. The next prime is 1206941. The reversal of 1206893 is 3986021.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1036324 + 170569 = 1018^2 + 413^2 .
It is a cyclic number.
It is not a de Polignac number, because 1206893 - 28 = 1206637 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (29), and also a Moran number because the ratio is a prime number: 41617 = 1206893 / (1 + 2 + 0 + 6 + 8 + 9 + 3).
It is a Duffinian number.
It is a plaindrome in base 13.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1203893) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 20780 + ... + 20837.
It is an arithmetic number, because the mean of its divisors is an integer number (312135).
21206893 is an apocalyptic number.
It is an amenable number.
1206893 is a deficient number, since it is larger than the sum of its proper divisors (41647).
1206893 is an equidigital number, since it uses as much as digits as its factorization.
1206893 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41646.
The product of its (nonzero) digits is 2592, while the sum is 29.
The square root of 1206893 is about 1098.5868195095. The cubic root of 1206893 is about 106.4689381667.
The spelling of 1206893 in words is "one million, two hundred six thousand, eight hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •