Recognised as Number

1,153,104

Positive
Even
Composite
7 digits

1,153,104 is an even 7-digit integer and a composite number. It has 20 divisors and a digital root of 6.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value1,153,104

Digit count7

Digit sum15

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 factorisation2^4 × 3 × 24,023

Distinct prime factors32, 3, 24,023

Number of divisors20

Sum of divisors σ(n)2,978,976

Aliquot sum1,825,872sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

Carmichael function λ(n)48,044the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 384,352

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 3, 4, 6, 8, 12, 16, 24, 48, 24,023, 48,046, 72,069, 96,092, 144,138, 192,184, 288,276, 384,368, 576,552, 1,153,10420 in total

Arithmetic

Previous number1,153,103

Next number1,153,105

Double2,306,208

Half576,552

Square1,329,648,834,816

Cube1,533,223,390,021,668,864

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

Cube root104.863132328≈

Negation-1,153,104

Reciprocal8.67224465 × 10^-7≈

Representations

Decimal1,153,104

Binary10001100110000101000021 bits

Octal4314120

Hexadecimal119850

Base 36OPQO

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

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

Ordinalone million, one hundred and fifty-three thousand, one hundred and fourth

Scientific notation1.153104 × 10^6

Engineering notation1.153104 × 10^6

In other bases

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

Quinary243344404base 5; one hand: 9 digits

Septenary12541551base 7: 8 digits

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

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

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

Sexagesimal5:20:18:24base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000100011001100001010000

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 even

Highest set bitbit 20worth 1,048,576

Lowest set bitbit 44 trailing zeros

Power of twoNo

Bytes311 98 50

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

At each machine width

32-bit00000000000100011001100001010000

64-bit0000000000000000000000000000000000000000000100011001100001010000

One's complement11111111111011100110011110101111at 32 bits, every bit flipped

Bits reversed00001010000110011000100000000000at 32 bits

Rotated left by 100000000001000110011000010100000at 32 bits, wrapping

Shifted left by 11000110011000010100000= 2,306,208, no wrap

Shifted right by 110001100110000101000= 576,552, discarding the low bit

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

Nearest landmarks

Next prime1,153,109+5

Previous prime1,153,099−5

Distance to nearest prime5

Nearest square below1,151,329

Nearest square above1,153,476

Powers & multiples

1,153,104 to the power 21,329,648,834,816

1,153,104 to the power 31,533,223,390,021,668,864

1,153,104 to the power 41,767,966,023,927,546,453,753,856

1,153,104 to the power 52,038,648,694,054,949,526,009,386,369,024

First ten multiples1,153,104, 2,306,208, 3,459,312, 4,612,416, 5,765,520, 6,918,624, 8,071,728, 9,224,832, 10,377,936, 11,531,040

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 4

Divisible by 6Yes

Divisible by 7No, remainder 1

Divisible by 8Yes

Divisible by 9No, remainder 6

Divisible by 10No, remainder 4

Divisible by 11No, remainder 7

Divisible by 12Yes

Divisible by 100No, remainder 4

Collatz (3n + 1) trajectory

Steps to reach 146the total stopping time

Highest value reached1,153,104

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

First steps1,153,104 → 576,552 → 288,276 → 144,138 → 72,069 → 216,208 → 108,104 → 54,052 → 27,026 → 13,513 → …

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

As a percentage & fraction

As a percentage115,310,400%

1,153,104% as a decimal11,531.04

1,153,104% of 1001,153,104

1,153,104% of 1,00011,531,040

As a fraction of 1001,153,104/100

Read another way

As seconds13 days, 8 hours and 18 minutes

As bytes1.1 MiB

As a 24-bit colour#119850

Keep nerding

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