Recognised as Number
1,074,604
- Positive
- Even
- Composite
- 7 digits
1,074,604 is an even 7-digit integer and a composite number. It has 12 divisors and a digital root of 4.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,074,604
Digit count7
Digit sum22
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^2 × 17 × 15,803
Distinct prime factors32, 17, 15,803
Number of divisors12
Sum of divisors σ(n)1,991,304
Aliquot sum916,700sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)505,664integers below n that share no factor with it
Carmichael function λ(n)126,416the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 505,664
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 17, 34, 68, 15,803, 31,606, 63,212, 268,651, 537,302, 1,074,60412 in total
Arithmetic
Previous number1,074,603
Next number1,074,605
Double2,149,208
Half537,302
Square1,154,773,756,816
Cube1,240,924,498,169,500,864
Square root1,036.631081919≈irrational, shown to 9 decimal places
Cube root102.427400504≈
Negation-1,074,604
Reciprocal9.30575356 × 10^-7≈
Representations
Decimal1,074,604
Binary10000011001011010110021 bits
Octal4062654
Hexadecimal1065AC
Base 36N164
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, seventy-four thousand, six hundred and four
Ordinalone million, seventy-four thousand, six hundred and fourth
Scientific notation1.074604 × 10^6
Engineering notation1.074604 × 10^6
In other bases
Ternary2000121002011base 3; the most digit-efficient integer base after e: 13 digits
Quinary233341404base 5; one hand: 9 digits
Septenary12063646base 7: 8 digits
Nonary2017064base 9; each digit is two ternary digits: 7 digits
Duodecimal439a64base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal6e6a4base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal4:58:30:4base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T001TT101T011digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100011011101011111100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100000110010110101100
Bit length21 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits12within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes310 65 ac
Gray code110000101011101111010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100000110010110101100
64-bit0000000000000000000000000000000000000000000100000110010110101100
One's complement11111111111011111001101001010011at 32 bits, every bit flipped
Bits reversed00110101101001100000100000000000at 32 bits
Rotated left by 100000000001000001100101101011000at 32 bits, wrapping
Shifted left by 11000001100101101011000= 2,149,208, no wrap
Shifted right by 110000011001011010110= 537,302, discarding the low bit
These bits as a double5.30924919 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,074,604 to the power 21,154,773,756,816
1,074,604 to the power 31,240,924,498,169,500,864
1,074,604 to the power 41,333,502,429,430,938,306,457,856
1,074,604 to the power 51,432,987,044,676,204,027,872,837,889,024
First ten multiples1,074,604, 2,149,208, 3,223,812, 4,298,416, 5,373,020, 6,447,624, 7,522,228, 8,596,832, 9,671,436, 10,746,040
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 6
Divisible by 8No, remainder 4
Divisible by 9No, remainder 4
Divisible by 10No, remainder 4
Divisible by 11No, remainder 3
Divisible by 12No, remainder 4
Divisible by 100No, remainder 4
Collatz (3n + 1) trajectory
Steps to reach 172the total stopping time
Highest value reached1,208,9321× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,074,604 → 537,302 → 268,651 → 805,954 → 402,977 → 1,208,932 → 604,466 → 302,233 → 906,700 → 453,350 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage107,460,400%
1,074,604% as a decimal10,746.04
1,074,604% of 1001,074,604
1,074,604% of 1,00010,746,040
As a fraction of 1001,074,604/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,074,604
Nerdulate something else
Nothing in mind? Surprise me · today’s page