Recognised as Number
1,059,094
- Positive
- Even
- Composite
- 7 digits
1,059,094 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,059,094
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 × 529,547
Distinct prime factors22, 529,547
Number of divisors4
Sum of divisors σ(n)1,588,644
Aliquot sum529,550sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)529,546integers below n that share no factor with it
Carmichael function λ(n)529,546the 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, 529,547, 1,059,0944 in total
Arithmetic
Previous number1,059,093
Next number1,059,095
Double2,118,188
Half529,547
Square1,121,680,100,836
Cube1,187,964,664,714,802,584
Square root1,029.122927546≈irrational, shown to 9 decimal places
Cube root101.932224616≈
Negation-1,059,094
Reciprocal9.44203253 × 10^-7≈
Representations
Decimal1,059,094
Binary10000001010010001011021 bits
Octal4024426
Hexadecimal102916
Base 36MP7A
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, fifty-nine thousand and ninety-four
Ordinalone million, fifty-nine thousand and ninety-fourth
Scientific notation1.059094 × 10^6
Engineering notation1.059094 × 10^6
In other bases
Ternary1222210210201base 3; the most digit-efficient integer base after e: 13 digits
Quinary232342334base 5; one hand: 9 digits
Septenary12000511base 7: 8 digits
Nonary1883721base 9; each digit is two ternary digits: 7 digits
Duodecimal430a9abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal6c7eebase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal4:54:11:34base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T000T11T11T01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100000111100101101010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100000010100100010110
Bit length21 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits14within that length
Bit parityodd7 set bits, so odd; 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 29 16
Gray code110000011110110011101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100000010100100010110
64-bit0000000000000000000000000000000000000000000100000010100100010110
One's complement11111111111011111101011011101001at 32 bits, every bit flipped
Bits reversed01101000100101000000100000000000at 32 bits
Rotated left by 100000000001000000101001000101100at 32 bits, wrapping
Shifted left by 11000000101001000101100= 2,118,188, no wrap
Shifted right by 110000001010010001011= 529,547, discarding the low bit
These bits as a double5.23261961 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,059,094 to the power 21,121,680,100,836
1,059,094 to the power 31,187,964,664,714,802,584
1,059,094 to the power 41,258,166,248,611,459,127,898,896
1,059,094 to the power 51,332,516,324,906,904,693,602,953,360,224
First ten multiples1,059,094, 2,118,188, 3,177,282, 4,236,376, 5,295,470, 6,354,564, 7,413,658, 8,472,752, 9,531,846, 10,590,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 1
Divisible by 8No, remainder 6
Divisible by 9No, remainder 1
Divisible by 10No, remainder 4
Divisible by 11No, remainder 3
Divisible by 12No, remainder 10
Divisible by 100No, remainder 94
Collatz (3n + 1) trajectory
Steps to reach 1103the total stopping time
Highest value reached2,382,9642× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,059,094 → 529,547 → 1,588,642 → 794,321 → 2,382,964 → 1,191,482 → 595,741 → 1,787,224 → 893,612 → 446,806 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage105,909,400%
1,059,094% as a decimal10,590.94
1,059,094% of 1001,059,094
1,059,094% of 1,00010,590,940
As a fraction of 1001,059,094/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,059,094
Nerdulate something else
Nothing in mind? Surprise me · today’s page