Recognised as Number
1,073,334
- Positive
- Even
- Composite
- 7 digits
1,073,334 is an even 7-digit integer and a composite number. It has 8 divisors and a digital root of 3.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,073,334
Digit count7
Digit sum21
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 3 × 178,889
Distinct prime factors32, 3, 178,889
Number of divisors8
Sum of divisors σ(n)2,146,680
Aliquot sum1,073,346sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)357,776integers below n that share no factor with it
Carmichael function λ(n)178,888the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 357,776
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 3, 6, 178,889, 357,778, 536,667, 1,073,3348 in total
Arithmetic
Previous number1,073,333
Next number1,073,335
Double2,146,668
Half536,667
Square1,152,045,875,556
Cube1,236,530,007,794,023,704
Square root1,036.018339606≈irrational, shown to 9 decimal places
Cube root102.387033982≈
Negation-1,073,334
Reciprocal9.3167644 × 10^-7≈
Representations
Decimal1,073,334
Binary10000011000001011011021 bits
Octal4060266
Hexadecimal1060B6
Base 36N06U
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, seventy-three thousand, three hundred and thirty-four
Ordinalone million, seventy-three thousand, three hundred and thirty-fourth
Scientific notation1.073334 × 10^6
Engineering notation1.073334 × 10^6
In other bases
Ternary2000112100010base 3; the most digit-efficient integer base after e: 13 digits
Quinary233321314base 5; one hand: 9 digits
Septenary12060153base 7: 8 digits
Nonary2015303base 9; each digit is two ternary digits: 7 digits
Duodecimal439186base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal6e36ebase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal4:58:8:54base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T001TTT100010digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100011010000111001010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100000110000010110110
Bit length21 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits13within that length
Bit parityeven8 set bits, so even; not the same as the number itself being even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes310 60 b6
Gray code110000101000011101101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100000110000010110110
64-bit0000000000000000000000000000000000000000000100000110000010110110
One's complement11111111111011111001111101001001at 32 bits, every bit flipped
Bits reversed01101101000001100000100000000000at 32 bits
Rotated left by 100000000001000001100000101101100at 32 bits, wrapping
Shifted left by 11000001100000101101100= 2,146,668, no wrap
Shifted right by 110000011000001011011= 536,667, discarding the low bit
These bits as a double5.30297456 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,073,334 to the power 21,152,045,875,556
1,073,334 to the power 31,236,530,007,794,023,704
1,073,334 to the power 41,327,209,699,385,590,638,309,136
1,073,334 to the power 51,424,539,295,480,333,542,178,898,179,424
First ten multiples1,073,334, 2,146,668, 3,220,002, 4,293,336, 5,366,670, 6,440,004, 7,513,338, 8,586,672, 9,660,006, 10,733,340
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4No, remainder 2
Divisible by 5No, remainder 4
Divisible by 6Yes
Divisible by 7No, remainder 3
Divisible by 8No, remainder 6
Divisible by 9No, remainder 3
Divisible by 10No, remainder 4
Divisible by 11No, remainder 9
Divisible by 12No, remainder 6
Divisible by 100No, remainder 34
Collatz (3n + 1) trajectory
Steps to reach 1121the total stopping time
Highest value reached10,315,6729× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,073,334 → 536,667 → 1,610,002 → 805,001 → 2,415,004 → 1,207,502 → 603,751 → 1,811,254 → 905,627 → 2,716,882 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage107,333,400%
1,073,334% as a decimal10,733.34
1,073,334% of 1001,073,334
1,073,334% of 1,00010,733,340
As a fraction of 1001,073,334/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,073,334
Nerdulate something else
Nothing in mind? Surprise me · today’s page