Base | Representation |
---|---|
bin | 100101011110011011101 |
3 | 2022101111101 |
4 | 10223303131 |
5 | 303243442 |
6 | 42153101 |
7 | 13303111 |
oct | 4536335 |
9 | 2271441 |
10 | 1227997 |
11 | 769681 |
12 | 4b2791 |
13 | 33cc34 |
14 | 23d741 |
15 | 193cb7 |
hex | 12bcdd |
1227997 has 4 divisors (see below), whose sum is σ = 1230876. Its totient is φ = 1225120.
The previous prime is 1227983. The next prime is 1228001. The reversal of 1227997 is 7997221.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 7997221 = 109 ⋅73369.
It can be written as a sum of positive squares in 2 ways, for example, as 285156 + 942841 = 534^2 + 971^2 .
It is a cyclic number.
It is not a de Polignac number, because 1227997 - 211 = 1225949 is a prime.
It is a Duffinian number.
It is a plaindrome in base 16.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1227917) 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, 658 + ... + 1699.
It is an arithmetic number, because the mean of its divisors is an integer number (307719).
21227997 is an apocalyptic number.
It is an amenable number.
1227997 is a deficient number, since it is larger than the sum of its proper divisors (2879).
1227997 is an equidigital number, since it uses as much as digits as its factorization.
1227997 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2878.
The product of its digits is 15876, while the sum is 37.
The square root of 1227997 is about 1108.1502605694. The cubic root of 1227997 is about 107.0859355637.
Subtracting from 1227997 its product of digits (15876), we obtain a palindrome (1212121).
The spelling of 1227997 in words is "one million, two hundred twenty-seven thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •