Base | Representation |
---|---|
bin | 100101011101110000000 |
3 | 2022101000110 |
4 | 10223232000 |
5 | 303241043 |
6 | 42151320 |
7 | 13302102 |
oct | 4535600 |
9 | 2271013 |
10 | 1227648 |
11 | 769394 |
12 | 4b2540 |
13 | 33ca26 |
14 | 23d572 |
15 | 193b33 |
hex | 12bb80 |
1227648 has 64 divisors (see below), whose sum is σ = 3427200. Its totient is φ = 388608.
The previous prime is 1227637. The next prime is 1227649. The reversal of 1227648 is 8467221.
It is a tau number, because it is divible by the number of its divisors (64).
It is a super-2 number, since 2×12276482 = 3014239223808, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1227649) 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, 8763 + ... + 8901.
It is an arithmetic number, because the mean of its divisors is an integer number (53550).
21227648 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1227648, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1713600).
1227648 is an abundant number, since it is smaller than the sum of its proper divisors (2199552).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1227648 is a wasteful number, since it uses less digits than its factorization.
1227648 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 179 (or 167 counting only the distinct ones).
The product of its digits is 5376, while the sum is 30.
The square root of 1227648 is about 1107.9927797599. The cubic root of 1227648 is about 107.0757899003.
It can be divided in two parts, 12 and 27648, that multiplied together give a 4-th power (331776 = 244).
The spelling of 1227648 in words is "one million, two hundred twenty-seven thousand, six hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •