Recognised as Number

1,123,353

Positive
Odd
Composite
7 digits

1,123,353 is an odd 7-digit integer and a composite number. It has 24 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value1,123,353

Digit count7

Digit sum18

Digit product270

Multiplicative persistence2times the digit product can be taken before one digit is left

Digital root9repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3^2 × 7 × 11 × 1,621

Distinct prime factors43, 7, 11, 1,621

Number of divisors24

Sum of divisors σ(n)2,024,256

Aliquot sum900,903sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)1,620the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 583,200

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

SquarefreeNohas a repeated prime factor

All divisors1, 3, 7, 9, 11, 21, 33, 63, 77, 99, 231, 693, 1,621, 4,863, 11,347, 14,589, 17,831, 34,041, 53,493, 102,123, 124,817, 160,479, 374,451, 1,123,35324 in total

Arithmetic

Previous number1,123,352

Next number1,123,354

Double2,246,706

Half561,676.5

Square1,261,921,962,609

Cube1,417,583,822,462,707,977

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

Cube root103.953412319≈

Negation-1,123,353

Reciprocal8.9019213 × 10^-7≈

Representations

Decimal1,123,353

Binary10001001001000001100121 bits

Octal4222031

Hexadecimal112419

Base 36O2S9

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

In wordsone million, one hundred and twenty-three thousand, three hundred and fifty-three

Ordinalone million, one hundred and twenty-three thousand, three hundred and fifty-third

Scientific notation1.123353 × 10^6

Engineering notation1.123353 × 10^6

In other bases

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

Quinary241421403base 5; one hand: 9 digits

Septenary12356040base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000000100010010010000011001

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 24 19

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

At each machine width

32-bit00000000000100010010010000011001

64-bit0000000000000000000000000000000000000000000100010010010000011001

One's complement11111111111011101101101111100110at 32 bits, every bit flipped

Bits reversed10011000001001001000100000000000at 32 bits

Rotated left by 100000000001000100100100000110010at 32 bits, wrapping

Shifted left by 11000100100100000110010= 2,246,706, no wrap

Shifted right by 110001001001000001100= 561,676, discarding the low bit

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

Nearest landmarks

Next prime1,123,361+8

Previous prime1,123,351−2

Distance to nearest prime2

Nearest square below1,121,481

Nearest square above1,123,600

Powers & multiples

1,123,353 to the power 21,261,921,962,609

1,123,353 to the power 31,417,583,822,462,707,977

1,123,353 to the power 41,592,447,039,714,950,394,086,881

1,123,353 to the power 51,788,880,159,404,908,670,048,680,031,993

First ten multiples1,123,353, 2,246,706, 3,370,059, 4,493,412, 5,616,765, 6,740,118, 7,863,471, 8,986,824, 10,110,177, 11,233,530

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 1

Divisible by 5No, remainder 3

Divisible by 6No, remainder 3

Divisible by 7Yes

Divisible by 8No, remainder 1

Divisible by 9Yes

Divisible by 10No, remainder 3

Divisible by 11Yes

Divisible by 12No, remainder 9

Divisible by 100No, remainder 53

Collatz (3n + 1) trajectory

Steps to reach 1108the total stopping time

Highest value reached3,791,3203× the starting value

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

First steps1,123,353 → 3,370,060 → 1,685,030 → 842,515 → 2,527,546 → 1,263,773 → 3,791,320 → 1,895,660 → 947,830 → 473,915 → …

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

As a percentage & fraction

As a percentage112,335,300%

1,123,353% as a decimal11,233.53

1,123,353% of 1001,123,353

1,123,353% of 1,00011,233,530

As a fraction of 1001,123,353/100

Read another way

As seconds13 days, 2 minutes and 33 seconds

As bytes1.071 MiB

As a 24-bit colour#112419

Keep nerding

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