Recognised as Number
1,057,635
- Positive
- Odd
- Composite
- 7 digits
1,057,635 is an odd 7-digit integer and a composite number. It has 24 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,057,635
Digit count7
Digit sum27
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3^2 × 5 × 19 × 1,237
Distinct prime factors43, 5, 19, 1,237
Number of divisors24
Sum of divisors σ(n)1,931,280
Aliquot sum873,645sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)533,952integers below n that share no factor with it
Carmichael function λ(n)3,708the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 533,952
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 5, 9, 15, 19, 45, 57, 95, 171, 285, 855, 1,237, 3,711, 6,185, 11,133, 18,555, 23,503, 55,665, 70,509, 117,515, 211,527, 352,545, 1,057,63524 in total
Arithmetic
Previous number1,057,634
Next number1,057,636
Double2,115,270
Half528,817.5
Square1,118,591,793,225
Cube1,183,061,831,227,522,875
Square root1,028.413827212≈irrational, shown to 9 decimal places
Cube root101.885396081≈
Negation-1,057,635
Reciprocal9.45505775 × 10^-7≈
Representations
Decimal1,057,635
Binary10000001000110110001121 bits
Octal4021543
Hexadecimal102363
Base 36MO2R
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, fifty-seven thousand, six hundred and thirty-five
Ordinalone million, fifty-seven thousand, six hundred and thirty-fifth
Scientific notation1.057635 × 10^6
Engineering notation1.057635 × 10^6
In other bases
Ternary1222201210200base 3; the most digit-efficient integer base after e: 13 digits
Quinary232321020base 5; one hand: 9 digits
Septenary11663325base 7: 8 digits
Nonary1881720base 9; each digit is two ternary digits: 7 digits
Duodecimal430083base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal6c41fbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal4:53:47:15base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T000T1TT11T00digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100000110010010100111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100000010001101100011
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 odd
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes310 23 63
Gray code110000011001011010010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100000010001101100011
64-bit0000000000000000000000000000000000000000000100000010001101100011
One's complement11111111111011111101110010011100at 32 bits, every bit flipped
Bits reversed11000110110001000000100000000000at 32 bits
Rotated left by 100000000001000000100011011000110at 32 bits, wrapping
Shifted left by 11000000100011011000110= 2,115,270, no wrap
Shifted right by 110000001000110110001= 528,817, discarding the low bit
These bits as a double5.22541119 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,057,635 to the power 21,118,591,793,225
1,057,635 to the power 31,183,061,831,227,522,875
1,057,635 to the power 41,251,247,599,870,321,155,900,625
1,057,635 to the power 51,323,363,255,288,847,115,720,957,521,875
First ten multiples1,057,635, 2,115,270, 3,172,905, 4,230,540, 5,288,175, 6,345,810, 7,403,445, 8,461,080, 9,518,715, 10,576,350
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 5Yes
Divisible by 6No, remainder 3
Divisible by 7No, remainder 5
Divisible by 8No, remainder 3
Divisible by 9Yes
Divisible by 10No, remainder 5
Divisible by 11No, remainder 7
Divisible by 12No, remainder 3
Divisible by 100No, remainder 35
Collatz (3n + 1) trajectory
Steps to reach 1165the total stopping time
Highest value reached4,759,3604× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,057,635 → 3,172,906 → 1,586,453 → 4,759,360 → 2,379,680 → 1,189,840 → 594,920 → 297,460 → 148,730 → 74,365 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage105,763,500%
1,057,635% as a decimal10,576.35
1,057,635% of 1001,057,635
1,057,635% of 1,00010,576,350
As a fraction of 1001,057,635/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,057,635
Nerdulate something else
Nothing in mind? Surprise me · today’s page