Recognised as Number
1,056,394
- Positive
- Even
- Composite
- 7 digits
1,056,394 is an even 7-digit integer and a composite number. It has 4 divisors and a digital root of 1.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,056,394
Digit count7
Digit sum28
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 528,197
Distinct prime factors22, 528,197
Number of divisors4
Sum of divisors σ(n)1,584,594
Aliquot sum528,200sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)528,196integers below n that share no factor with it
Carmichael function λ(n)528,196the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 528,197, 1,056,3944 in total
Arithmetic
Previous number1,056,393
Next number1,056,395
Double2,112,788
Half528,197
Square1,115,968,283,236
Cube1,178,902,198,600,810,984
Square root1,027.81029378≈irrational, shown to 9 decimal places
Cube root101.845530638≈
Negation-1,056,394
Reciprocal9.46616509 × 10^-7≈
Representations
Decimal1,056,394
Binary10000000111101000101021 bits
Octal4017212
Hexadecimal101E8A
Base 36MN4A
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, fifty-six thousand, three hundred and ninety-four
Ordinalone million, fifty-six thousand, three hundred and ninety-fourth
Scientific notation1.056394 × 10^6
Engineering notation1.056394 × 10^6
In other bases
Ternary1222200002201base 3; the most digit-efficient integer base after e: 13 digits
Quinary232301034base 5; one hand: 9 digits
Septenary11656603base 7: 8 digits
Nonary1880081base 9; each digit is two ternary digits: 7 digits
Duodecimal42b40abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal6c0jebase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal4:53:26:34base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T000T00010T01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100000110001110011110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100000001111010001010
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 1e 8a
Gray code110000001000111001111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100000001111010001010
64-bit0000000000000000000000000000000000000000000100000001111010001010
One's complement11111111111011111110000101110101at 32 bits, every bit flipped
Bits reversed01010001011110000000100000000000at 32 bits
Rotated left by 100000000001000000011110100010100at 32 bits, wrapping
Shifted left by 11000000011110100010100= 2,112,788, no wrap
Shifted right by 110000000111101000101= 528,197, discarding the low bit
These bits as a double5.21927984 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,056,394 to the power 21,115,968,283,236
1,056,394 to the power 31,178,902,198,600,810,984
1,056,394 to the power 41,245,385,209,188,705,118,631,696
1,056,394 to the power 51,315,617,462,675,692,955,091,811,864,224
First ten multiples1,056,394, 2,112,788, 3,169,182, 4,225,576, 5,281,970, 6,338,364, 7,394,758, 8,451,152, 9,507,546, 10,563,940
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 4No, remainder 2
Divisible by 5No, remainder 4
Divisible by 6No, remainder 4
Divisible by 7No, remainder 3
Divisible by 8No, remainder 2
Divisible by 9No, remainder 1
Divisible by 10No, remainder 4
Divisible by 11No, remainder 9
Divisible by 12No, remainder 10
Divisible by 100No, remainder 94
Collatz (3n + 1) trajectory
Steps to reach 177the total stopping time
Highest value reached1,584,5921× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,056,394 → 528,197 → 1,584,592 → 792,296 → 396,148 → 198,074 → 99,037 → 297,112 → 148,556 → 74,278 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage105,639,400%
1,056,394% as a decimal10,563.94
1,056,394% of 1001,056,394
1,056,394% of 1,00010,563,940
As a fraction of 1001,056,394/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,056,394
Nerdulate something else
Nothing in mind? Surprise me · today’s page