Recognised as Number
1,126,435
- Positive
- Odd
- Composite
- 7 digits
1,126,435 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,126,435
Digit count7
Digit sum22
Digit product720
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation5 × 225,287
Distinct prime factors25, 225,287
Number of divisors4
Sum of divisors σ(n)1,351,728
Aliquot sum225,293sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)901,144integers below n that share no factor with it
Carmichael function λ(n)450,572the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 901,144
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 5, 225,287, 1,126,4354 in total
Arithmetic
Previous number1,126,434
Next number1,126,436
Double2,252,870
Half563,217.5
Square1,268,855,809,225
Cube1,429,283,593,464,362,875
Square root1,061.336421687≈irrational, shown to 9 decimal places
Cube root104.048393405≈
Negation-1,126,435
Reciprocal8.87756506 × 10^-7≈
Representations
Decimal1,126,435
Binary10001001100000010001121 bits
Octal4230043
Hexadecimal113023
Base 36O55V
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, one hundred and twenty-six thousand, four hundred and thirty-five
Ordinalone million, one hundred and twenty-six thousand, four hundred and thirty-fifth
Scientific notation1.126435 × 10^6
Engineering notation1.126435 × 10^6
In other bases
Ternary2010020011211base 3; the most digit-efficient integer base after e: 13 digits
Quinary242021220base 5; one hand: 9 digits
Septenary12401032base 7: 8 digits
Nonary2106154base 9; each digit is two ternary digits: 7 digits
Duodecimal463a57base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal70g1fbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:12:53:55base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0101T01TTT11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100010111000001100111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100010011000000100011
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 odd
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes311 30 23
Gray code110011010100000110010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100010011000000100011
64-bit0000000000000000000000000000000000000000000100010011000000100011
One's complement11111111111011101100111111011100at 32 bits, every bit flipped
Bits reversed11000100000011001000100000000000at 32 bits
Rotated left by 100000000001000100110000001000110at 32 bits, wrapping
Shifted left by 11000100110000001000110= 2,252,870, no wrap
Shifted right by 110001001100000010001= 563,217, discarding the low bit
These bits as a double5.56532836 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,126,435 to the power 21,268,855,809,225
1,126,435 to the power 31,429,283,593,464,362,875
1,126,435 to the power 41,609,995,064,604,029,595,100,625
1,126,435 to the power 51,813,554,790,597,240,076,957,172,521,875
First ten multiples1,126,435, 2,252,870, 3,379,305, 4,505,740, 5,632,175, 6,758,610, 7,885,045, 9,011,480, 10,137,915, 11,264,350
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 3
Divisible by 5Yes
Divisible by 6No, remainder 1
Divisible by 7No, remainder 2
Divisible by 8No, remainder 3
Divisible by 9No, remainder 4
Divisible by 10No, remainder 5
Divisible by 11No, remainder 2
Divisible by 12No, remainder 7
Divisible by 100No, remainder 35
Collatz (3n + 1) trajectory
Steps to reach 1147the total stopping time
Highest value reached5,068,9604× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,126,435 → 3,379,306 → 1,689,653 → 5,068,960 → 2,534,480 → 1,267,240 → 633,620 → 316,810 → 158,405 → 475,216 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage112,643,500%
1,126,435% as a decimal11,264.35
1,126,435% of 1001,126,435
1,126,435% of 1,00011,264,350
As a fraction of 1001,126,435/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,126,435
Nerdulate something else
Nothing in mind? Surprise me · today’s page