Recognised as Number
1,105,359
- Positive
- Odd
- Composite
- 7 digits
1,105,359 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,105,359
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 × 368,453
Distinct prime factors23, 368,453
Number of divisors4
Sum of divisors σ(n)1,473,816
Aliquot sum368,457sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)736,904integers below n that share no factor with it
Carmichael function λ(n)368,452the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 736,904
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 368,453, 1,105,3594 in total
Arithmetic
Previous number1,105,358
Next number1,105,360
Double2,210,718
Half552,679.5
Square1,221,818,518,881
Cube1,350,548,096,211,783,279
Square root1,051.360547101≈irrational, shown to 9 decimal places
Cube root103.395376084≈
Negation-1,105,359
Reciprocal9.04683456 × 10^-7≈
Representations
Decimal1,105,359
Binary10000110111011100111121 bits
Octal4156717
Hexadecimal10DDCF
Base 36NOWF
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, one hundred and five thousand, three hundred and fifty-nine
Ordinalone million, one hundred and five thousand, three hundred and fifty-ninth
Scientific notation1.105359 × 10^6
Engineering notation1.105359 × 10^6
In other bases
Ternary2002011021020base 3; the most digit-efficient integer base after e: 13 digits
Quinary240332414base 5; one hand: 9 digits
Septenary12252423base 7: 8 digits
Nonary2064236base 9; each digit is two ternary digits: 7 digits
Duodecimal453813base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal6i37jbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:7:2:39base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T01T0111T11T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100010010001011010011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100001101110111001111
Bit length21 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits8within that length
Bit parityodd13 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 dd cf
Gray code110001011001100101000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100001101110111001111
64-bit0000000000000000000000000000000000000000000100001101110111001111
One's complement11111111111011110010001000110000at 32 bits, every bit flipped
Bits reversed11110011101110110000100000000000at 32 bits
Rotated left by 100000000001000011011101110011110at 32 bits, wrapping
Shifted left by 11000011011101110011110= 2,210,718, no wrap
Shifted right by 110000110111011100111= 552,679, discarding the low bit
These bits as a double5.46119908 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,105,359 to the power 21,221,818,518,881
1,105,359 to the power 31,350,548,096,211,783,279
1,105,359 to the power 41,492,840,493,080,560,553,492,161
1,105,359 to the power 51,650,124,674,591,035,332,847,541,590,799
First ten multiples1,105,359, 2,210,718, 3,316,077, 4,421,436, 5,526,795, 6,632,154, 7,737,513, 8,842,872, 9,948,231, 11,053,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 3
Divisible by 8No, remainder 7
Divisible by 9No, remainder 6
Divisible by 10No, remainder 9
Divisible by 11No, remainder 2
Divisible by 12No, remainder 3
Divisible by 100No, remainder 59
Collatz (3n + 1) trajectory
Steps to reach 1147the total stopping time
Highest value reached11,191,76810× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,105,359 → 3,316,078 → 1,658,039 → 4,974,118 → 2,487,059 → 7,461,178 → 3,730,589 → 11,191,768 → 5,595,884 → 2,797,942 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage110,535,900%
1,105,359% as a decimal11,053.59
1,105,359% of 1001,105,359
1,105,359% of 1,00011,053,590
As a fraction of 1001,105,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,105,359
Nerdulate something else
Nothing in mind? Surprise me · today’s page