Recognised as Number
1,105,059
- Positive
- Odd
- Composite
- 7 digits
1,105,059 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,105,059
Digit count7
Digit sum21
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 19 × 19,387
Distinct prime factors33, 19, 19,387
Number of divisors8
Sum of divisors σ(n)1,551,040
Aliquot sum445,981sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)697,896integers below n that share no factor with it
Carmichael function λ(n)19,386the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 697,896
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 19, 57, 19,387, 58,161, 368,353, 1,105,0598 in total
Arithmetic
Previous number1,105,058
Next number1,105,060
Double2,210,118
Half552,529.5
Square1,221,155,393,481
Cube1,349,448,757,964,720,379
Square root1,051.217865145≈irrational, shown to 9 decimal places
Cube root103.386021229≈
Negation-1,105,059
Reciprocal9.04929058 × 10^-7≈
Representations
Decimal1,105,059
Binary10000110111001010001121 bits
Octal4156243
Hexadecimal10DCA3
Base 36NOO3
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, one hundred and five thousand and fifty-nine
Ordinalone million, one hundred and five thousand and fifty-ninth
Scientific notation1.105059 × 10^6
Engineering notation1.105059 × 10^6
In other bases
Ternary2002010212010base 3; the most digit-efficient integer base after e: 13 digits
Quinary240330214base 5; one hand: 9 digits
Septenary12251514base 7: 8 digits
Nonary2063763base 9; each digit is two ternary digits: 7 digits
Duodecimal453603base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal6i2cjbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:6:57:39base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T01T0110TT010digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100010010110111100111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100001101110010100011
Bit length21 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits11within that length
Bit parityeven10 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 dc a3
Gray code110001011001011110010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100001101110010100011
64-bit0000000000000000000000000000000000000000000100001101110010100011
One's complement11111111111011110010001101011100at 32 bits, every bit flipped
Bits reversed11000101001110110000100000000000at 32 bits
Rotated left by 100000000001000011011100101000110at 32 bits, wrapping
Shifted left by 11000011011100101000110= 2,210,118, no wrap
Shifted right by 110000110111001010001= 552,529, discarding the low bit
These bits as a double5.45971689 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,105,059 to the power 21,221,155,393,481
1,105,059 to the power 31,349,448,757,964,720,379
1,105,059 to the power 41,491,220,495,027,735,937,297,361
1,105,059 to the power 51,647,886,629,014,854,847,133,884,449,299
First ten multiples1,105,059, 2,210,118, 3,315,177, 4,420,236, 5,525,295, 6,630,354, 7,735,413, 8,840,472, 9,945,531, 11,050,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 4
Divisible by 8No, remainder 3
Divisible by 9No, remainder 3
Divisible by 10No, remainder 9
Divisible by 11No, remainder 10
Divisible by 12No, remainder 3
Divisible by 100No, remainder 59
Collatz (3n + 1) trajectory
Steps to reach 172the total stopping time
Highest value reached4,972,7684× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,105,059 → 3,315,178 → 1,657,589 → 4,972,768 → 2,486,384 → 1,243,192 → 621,596 → 310,798 → 155,399 → 466,198 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage110,505,900%
1,105,059% as a decimal11,050.59
1,105,059% of 1001,105,059
1,105,059% of 1,00011,050,590
As a fraction of 1001,105,059/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,059
Nerdulate something else
Nothing in mind? Surprise me · today’s page