Recognised as Number
1,123,359
- Positive
- Odd
- Composite
- 7 digits
1,123,359 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,123,359
Digit count7
Digit sum24
Digit product810
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 41 × 9,133
Distinct prime factors33, 41, 9,133
Number of divisors8
Sum of divisors σ(n)1,534,512
Aliquot sum411,153sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)730,560integers below n that share no factor with it
Carmichael function λ(n)91,320the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 730,560
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 41, 123, 9,133, 27,399, 374,453, 1,123,3598 in total
Arithmetic
Previous number1,123,358
Next number1,123,360
Double2,246,718
Half561,679.5
Square1,261,935,442,881
Cube1,417,606,537,179,357,279
Square root1,059.886314658≈irrational, shown to 9 decimal places
Cube root103.953597396≈
Negation-1,123,359
Reciprocal8.90187376 × 10^-7≈
Representations
Decimal1,123,359
Binary10001001001000001111121 bits
Octal4222037
Hexadecimal11241F
Base 36O2SF
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, one hundred and twenty-three thousand, three hundred and fifty-nine
Ordinalone million, one hundred and twenty-three thousand, three hundred and fifty-ninth
Scientific notation1.123359 × 10^6
Engineering notation1.123359 × 10^6
In other bases
Ternary2010001221220base 3; the most digit-efficient integer base after e: 13 digits
Quinary241421414base 5; one hand: 9 digits
Septenary12356046base 7: 8 digits
Nonary2101856base 9; each digit is two ternary digits: 7 digits
Duodecimal462113base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal7087jbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:12:2:39base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T01001T00T0T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100010110010001100011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100010010010000011111
Bit length21 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits12within that length
Bit parityodd9 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 24 1f
Gray code110011011011000010000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100010010010000011111
64-bit0000000000000000000000000000000000000000000100010010010000011111
One's complement11111111111011101101101111100000at 32 bits, every bit flipped
Bits reversed11111000001001001000100000000000at 32 bits
Rotated left by 100000000001000100100100000111110at 32 bits, wrapping
Shifted left by 11000100100100000111110= 2,246,718, no wrap
Shifted right by 110001001001000001111= 561,679, discarding the low bit
These bits as a double5.5501309 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,123,359 to the power 21,261,935,442,881
1,123,359 to the power 31,417,606,537,179,357,279
1,123,359 to the power 41,592,481,061,999,265,613,580,161
1,123,359 to the power 51,788,927,933,326,433,020,405,796,080,799
First ten multiples1,123,359, 2,246,718, 3,370,077, 4,493,436, 5,616,795, 6,740,154, 7,863,513, 8,986,872, 10,110,231, 11,233,590
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 4
Divisible by 6No, remainder 3
Divisible by 7No, remainder 6
Divisible by 8No, remainder 7
Divisible by 9No, remainder 6
Divisible by 10No, remainder 9
Divisible by 11No, remainder 6
Divisible by 12No, remainder 3
Divisible by 100No, remainder 59
Collatz (3n + 1) trajectory
Steps to reach 1165the total stopping time
Highest value reached147,740,596131× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,123,359 → 3,370,078 → 1,685,039 → 5,055,118 → 2,527,559 → 7,582,678 → 3,791,339 → 11,374,018 → 5,687,009 → 17,061,028 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage112,335,900%
1,123,359% as a decimal11,233.59
1,123,359% of 1001,123,359
1,123,359% of 1,00011,233,590
As a fraction of 1001,123,359/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,123,359
Nerdulate something else
Nothing in mind? Surprise me · today’s page