Recognised as Number

11,828

Positive
Even
Composite
5 digits

11,828 is an even 5-digit integer and a composite number. It has 6 divisors and a digital root of 2.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value11,828

Digit count5

Digit sum20

Digit product128

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

Digital root2repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^2 × 2,957

Distinct prime factors22, 2,957

Number of divisors6

Sum of divisors σ(n)20,706

Aliquot sum8,878sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)2,956the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 5,912

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 4, 2,957, 5,914, 11,8286 in total

Arithmetic

Previous number11,827

Next number11,829

Double23,656

Half5,914

Square139,901,584

Cube1,654,755,935,552

Square root108.756608995≈irrational, shown to 9 decimal places

Cube root22.784374232≈

Negation-11,828

Reciprocal0.0000845451≈

Representations

Decimal11,828

Binary1011100011010014 bits

Octal27064

Hexadecimal2E34

Base 3694K

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

In wordseleven thousand, eight hundred and twenty-eight

Ordinaleleven thousand, eight hundred and twenty-eighth

Scientific notation1.1828 × 10^4

Engineering notation11.828 × 10^3

In other bases

Ternary121020002base 3; the most digit-efficient integer base after e: 9 digits

Quinary334303base 5; one hand: 6 digits

Septenary46325base 7: 5 digits

Nonary17202base 9; each digit is two ternary digits: 5 digits

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

Vigesimal19b8base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits

Sexagesimal3:17:8base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

0010111000110100

Bit length14 bitsto write the magnitude

Set bits7the population count, or Hamming weight

Zero bits7within that length

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

Highest set bitbit 13worth 8,192

Lowest set bitbit 22 trailing zeros

Power of twoNo

Bytes22e 34

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

At each machine width

16-bit0010111000110100

32-bit00000000000000000010111000110100

64-bit0000000000000000000000000000000000000000000000000010111000110100

One's complement1101000111001011at 16 bits, every bit flipped

Bits reversed0010110001110100at 16 bits

Rotated left by 10101110001101000at 16 bits, wrapping

Shifted left by 1101110001101000= 23,656, no wrap

Shifted right by 11011100011010= 5,914, discarding the low bit

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

Nearest landmarks

Next prime11,831+3

Previous prime11,827−1

Distance to nearest prime1

Nearest square below11,664

Nearest square above11,881

Powers & multiples

11,828 to the power 2139,901,584

11,828 to the power 31,654,755,935,552

11,828 to the power 419,572,453,205,709,056

11,828 to the power 5231,502,976,517,126,714,368

First ten multiples11,828, 23,656, 35,484, 47,312, 59,140, 70,968, 82,796, 94,624, 106,452, 118,280

Powers of twoBetween 2^13 (8,192) and 2^14 (16,384)

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 2

Divisible by 4Yes

Divisible by 5No, remainder 3

Divisible by 6No, remainder 2

Divisible by 7No, remainder 5

Divisible by 8No, remainder 4

Divisible by 9No, remainder 2

Divisible by 10No, remainder 8

Divisible by 11No, remainder 3

Divisible by 12No, remainder 8

Divisible by 100No, remainder 28

Collatz (3n + 1) trajectory

Steps to reach 124the total stopping time

Highest value reached11,828

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

First steps11,828 → 5,914 → 2,957 → 8,872 → 4,436 → 2,218 → 1,109 → 3,328 → 1,664 → 832 → …

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

As a percentage & fraction

As a percentage1,182,800%

11,828% as a decimal118.28

11,828% of 10011,828

11,828% of 1,000118,280

As a fraction of 10011,828/100

Read another way

As seconds3 hours, 17 minutes and 8 seconds

As bytes11.551 KiB

As a 24-bit colour#002E34

Keep nerding

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