Recognised as Number
1,227,664
- Positive
- Even
- Composite
- Perfect square
- 7 digits
1,227,664 is an even 7-digit integer and a composite number. It has 15 divisors and a digital root of 1.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,227,664
Digit count7
Digit sum28
Digit product4,032
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Perfect squareYes, 1,108²
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^4 × 277^2
Distinct prime factors22, 277
Number of divisors15
Sum of divisors σ(n)2,387,217
Aliquot sum1,159,553sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)611,616integers below n that share no factor with it
Carmichael function λ(n)76,452the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 611,616
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 16, 277, 554, 1,108, 2,216, 4,432, 76,729, 153,458, 306,916, 613,832, 1,227,66415 in total
Arithmetic
Previous number1,227,663
Next number1,227,665
Double2,455,328
Half613,832
Square1,507,158,896,896
Cube1,850,284,719,998,930,944
Square root1,108exact
Cube root107.076255073≈
Negation-1,227,664
Reciprocal8.14555123 × 10^-7≈
Representations
Decimal1,227,664
Binary10010101110111001000021 bits
Octal4535620
Hexadecimal12BB90
Base 36QB9S
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, two hundred and twenty-seven thousand, six hundred and sixty-four
Ordinalone million, two hundred and twenty-seven thousand, six hundred and sixty-fourth
Scientific notation1.227664 × 10^6
Engineering notation1.227664 × 10^6
In other bases
Ternary2022101001001base 3; the most digit-efficient integer base after e: 13 digits
Quinary303241124base 5; one hand: 9 digits
Septenary13302124base 7: 8 digits
Nonary2271031base 9; each digit is two ternary digits: 7 digits
Duodecimal4b2554base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal7d934base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:41:1:4base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T10T101001001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101111100110010010000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100101011101110010000
Bit length21 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits11within that length
Bit parityeven10 set bits, so even; not the same as the number itself being even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 44 trailing zeros
Power of twoNo
Bytes312 bb 90
Gray code110111110011001011000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100101011101110010000
64-bit0000000000000000000000000000000000000000000100101011101110010000
One's complement11111111111011010100010001101111at 32 bits, every bit flipped
Bits reversed00001001110111010100100000000000at 32 bits
Rotated left by 100000000001001010111011100100000at 32 bits, wrapping
Shifted left by 11001010111011100100000= 2,455,328, no wrap
Shifted right by 110010101110111001000= 613,832, discarding the low bit
These bits as a double6.06546607 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,227,664 to the power 21,507,158,896,896
1,227,664 to the power 31,850,284,719,998,930,944
1,227,664 to the power 42,271,527,940,492,767,558,434,816
1,227,664 to the power 52,788,673,077,537,112,991,858,319,949,824
First ten multiples1,227,664, 2,455,328, 3,682,992, 4,910,656, 6,138,320, 7,365,984, 8,593,648, 9,821,312, 11,048,976, 12,276,640
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4Yes
Divisible by 5No, remainder 4
Divisible by 6No, remainder 4
Divisible by 7No, remainder 4
Divisible by 8Yes
Divisible by 9No, remainder 1
Divisible by 10No, remainder 4
Divisible by 11No, remainder 9
Divisible by 12No, remainder 4
Divisible by 100No, remainder 64
Collatz (3n + 1) trajectory
Steps to reach 167the total stopping time
Highest value reached1,227,664
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,227,664 → 613,832 → 306,916 → 153,458 → 76,729 → 230,188 → 115,094 → 57,547 → 172,642 → 86,321 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage122,766,400%
1,227,664% as a decimal12,276.64
1,227,664% of 1001,227,664
1,227,664% of 1,00012,276,640
As a fraction of 1001,227,664/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 1,227,664
Nerdulate something else
Nothing in mind? Surprise me · today’s page