Recognised as Number

1,105,356

Positive
Even
Composite
7 digits

1,105,356 is an even 7-digit integer and a composite number. It has 24 divisors and a digital root of 3.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value1,105,356

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 numberYesdivisible by its own digit sum

Factors & divisors

Prime factorisation2^2 × 3 × 7 × 13,159

Distinct prime factors42, 3, 7, 13,159

Number of divisors24

Sum of divisors σ(n)2,947,840

Aliquot sum1,842,484sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

Euler's totient φ(n)315,792integers below n that share no factor with it

Carmichael function λ(n)13,158the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 315,792

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 2, 3, 4, 6, 7, 12, 14, 21, 28, 42, 84, 13,159, 26,318, 39,477, 52,636, 78,954, 92,113, 157,908, 184,226, 276,339, 368,452, 552,678, 1,105,35624 in total

Arithmetic

Previous number1,105,355

Next number1,105,357

Double2,210,712

Half552,678

Square1,221,811,886,736

Cube1,350,537,099,874,958,016

Square root1,051.359120377≈irrational, shown to 9 decimal places

Cube root103.395282544≈

Negation-1,105,356

Reciprocal9.04685911 × 10^-7≈

Representations

Decimal1,105,356

Binary10000110111011100110021 bits

Octal4156714

Hexadecimal10DDCC

Base 36NOWC

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordsone million, one hundred and five thousand, three hundred and fifty-six

Ordinalone million, one hundred and five thousand, three hundred and fifty-sixth

Scientific notation1.105356 × 10^6

Engineering notation1.105356 × 10^6

In other bases

Ternary2002011021010base 3; the most digit-efficient integer base after e: 13 digits

Quinary240332411base 5; one hand: 9 digits

Septenary12252420base 7: 8 digits

Nonary2064233base 9; each digit is two ternary digits: 7 digits

Duodecimal453810base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits

Vigesimal6i37gbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits

Sexagesimal5:7:2:36base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

Balanced ternary1T01T0111T1010digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary100010010001011011100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000100001101110111001100

Bit length21 bitsto write the magnitude

Set bits11the population count, or Hamming weight

Zero bits10within that length

Bit parityodd11 set bits, so odd; not the same as the number itself being even

Highest set bitbit 20worth 1,048,576

Lowest set bitbit 22 trailing zeros

Power of twoNo

Bytes310 dd cc

Gray code110001011001100101010n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000100001101110111001100

64-bit0000000000000000000000000000000000000000000100001101110111001100

One's complement11111111111011110010001000110011at 32 bits, every bit flipped

Bits reversed00110011101110110000100000000000at 32 bits

Rotated left by 100000000001000011011101110011000at 32 bits, wrapping

Shifted left by 11000011011101110011000= 2,210,712, no wrap

Shifted right by 110000110111011100110= 552,678, discarding the low bit

These bits as a double5.46118426 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime1,105,387+31

Previous prime1,105,343−13

Distance to nearest prime13

Nearest square below1,104,601

Nearest square above1,106,704

Powers & multiples

1,105,356 to the power 21,221,811,886,736

1,105,356 to the power 31,350,537,099,874,958,016

1,105,356 to the power 41,492,824,286,569,384,092,733,696

1,105,356 to the power 51,650,102,282,105,188,123,207,747,275,776

First ten multiples1,105,356, 2,210,712, 3,316,068, 4,421,424, 5,526,780, 6,632,136, 7,737,492, 8,842,848, 9,948,204, 11,053,560

Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)

Divisibility tests

Divisible by 2Yes

Divisible by 3Yes

Divisible by 4Yes

Divisible by 5No, remainder 1

Divisible by 6Yes

Divisible by 7Yes

Divisible by 8No, remainder 4

Divisible by 9No, remainder 3

Divisible by 10No, remainder 6

Divisible by 11No, remainder 10

Divisible by 12Yes

Divisible by 100No, remainder 56

Collatz (3n + 1) trajectory

Steps to reach 1178the total stopping time

Highest value reached1,243,5281× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps1,105,356 → 552,678 → 276,339 → 829,018 → 414,509 → 1,243,528 → 621,764 → 310,882 → 155,441 → 466,324 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage110,535,600%

1,105,356% as a decimal11,053.56

1,105,356% of 1001,105,356

1,105,356% of 1,00011,053,560

As a fraction of 1001,105,356/100

Read another way

As seconds12 days, 19 hours and 2 minutes

As bytes1.054 MiB

As a 24-bit colour#10DDCC

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.