Recognised as Number
1,052,691
- Positive
- Odd
- Composite
- 7 digits
1,052,691 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,052,691
Digit count7
Digit sum24
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 17 × 20,641
Distinct prime factors33, 17, 20,641
Number of divisors8
Sum of divisors σ(n)1,486,224
Aliquot sum433,533sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)660,480integers below n that share no factor with it
Carmichael function λ(n)20,640the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 660,480
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 17, 51, 20,641, 61,923, 350,897, 1,052,6918 in total
Arithmetic
Previous number1,052,690
Next number1,052,692
Double2,105,382
Half526,345.5
Square1,108,158,341,481
Cube1,166,548,312,651,975,371
Square root1,026.007309915≈irrational, shown to 9 decimal places
Cube root101.726390899≈
Negation-1,052,691
Reciprocal9.49946376 × 10^-7≈
Representations
Decimal1,052,691
Binary10000000100000001001121 bits
Octal4010023
Hexadecimal101013
Base 36MK9F
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, fifty-two thousand, six hundred and ninety-one
Ordinalone million, fifty-two thousand, six hundred and ninety-first
Scientific notation1.052691 × 10^6
Engineering notation1.052691 × 10^6
In other bases
Ternary1222111000120base 3; the most digit-efficient integer base after e: 13 digits
Quinary232141231base 5; one hand: 9 digits
Septenary11643033base 7: 8 digits
Nonary1874016base 9; each digit is two ternary digits: 7 digits
Duodecimal429243base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal6bbebbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal4:52:24:51base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T00T111001TT0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100000001000000010111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100000001000000010011
Bit length21 bitsto write the magnitude
Set bits5the population count, or Hamming weight
Zero bits16within that length
Bit parityodd5 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes310 10 13
Gray code110000001100000011010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100000001000000010011
64-bit0000000000000000000000000000000000000000000100000001000000010011
One's complement11111111111011111110111111101100at 32 bits, every bit flipped
Bits reversed11001000000010000000100000000000at 32 bits
Rotated left by 100000000001000000010000000100110at 32 bits, wrapping
Shifted left by 11000000010000000100110= 2,105,382, no wrap
Shifted right by 110000000100000001001= 526,345, discarding the low bit
These bits as a double5.20098459 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,052,691 to the power 21,108,158,341,481
1,052,691 to the power 31,166,548,312,651,975,371
1,052,691 to the power 41,228,014,909,793,920,605,273,361
1,052,691 to the power 51,292,720,243,405,872,075,885,819,664,451
First ten multiples1,052,691, 2,105,382, 3,158,073, 4,210,764, 5,263,455, 6,316,146, 7,368,837, 8,421,528, 9,474,219, 10,526,910
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 3
Divisible by 8No, remainder 3
Divisible by 9No, remainder 6
Divisible by 10No, remainder 1
Divisible by 11No, remainder 2
Divisible by 12No, remainder 3
Divisible by 100No, remainder 91
Collatz (3n + 1) trajectory
Steps to reach 1196the total stopping time
Highest value reached4,737,1124× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,052,691 → 3,158,074 → 1,579,037 → 4,737,112 → 2,368,556 → 1,184,278 → 592,139 → 1,776,418 → 888,209 → 2,664,628 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage105,269,100%
1,052,691% as a decimal10,526.91
1,052,691% of 1001,052,691
1,052,691% of 1,00010,526,910
As a fraction of 1001,052,691/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,052,691
Nerdulate something else
Nothing in mind? Surprise me · today’s page