Recognised as Number

11,831

Positive
Odd
Prime
5 digits

11,831 is an odd 5-digit integer and a prime number. It has 2 divisors and a digital root of 5.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value11,831

Digit count5

Digit sum14

Digit product24

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

Digital root5repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation11,831

Distinct prime factors111,831

Number of divisors2

Sum of divisors σ(n)11,832

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)11,830the smallest exponent with aˣ ≡ 1 for every unit coprime to n

Möbius function μ(n)−11 distinct prime factor, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 11,8312 in total

Arithmetic

Previous number11,830

Next number11,832

Double23,662

Half5,915.5

Square139,972,561

Cube1,656,015,369,191

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

Cube root22.786300378≈

Negation-11,831

Reciprocal0.0000845237≈

Representations

Decimal11,831

Binary1011100011011114 bits

Octal27067

Hexadecimal2E37

Base 3694N

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

In wordseleven thousand, eight hundred and thirty-one

Ordinaleleven thousand, eight hundred and thirty-first

Scientific notation1.1831 × 10^4

Engineering notation11.831 × 10^3

In other bases

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

Quinary334311base 5; one hand: 6 digits

Septenary46331base 7: 5 digits

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

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

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

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

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

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

Bit-level

0010111000110111

Bit length14 bitsto write the magnitude

Set bits9the population count, or Hamming weight

Zero bits5within that length

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

Highest set bitbit 13worth 8,192

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes22e 37

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

At each machine width

16-bit0010111000110111

32-bit00000000000000000010111000110111

64-bit0000000000000000000000000000000000000000000000000010111000110111

One's complement1101000111001000at 16 bits, every bit flipped

Bits reversed1110110001110100at 16 bits

Rotated left by 10101110001101110at 16 bits, wrapping

Shifted left by 1101110001101110= 23,662, no wrap

Shifted right by 11011100011011= 5,915, discarding the low bit

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

Nearest landmarks

Next prime11,833+2

Previous prime11,827−4

Distance to nearest prime0, it is prime

Nearest square below11,664

Nearest square above11,881

Powers & multiples

11,831 to the power 2139,972,561

11,831 to the power 31,656,015,369,191

11,831 to the power 419,592,317,832,898,721

11,831 to the power 5231,796,712,281,024,768,151

First ten multiples11,831, 23,662, 35,493, 47,324, 59,155, 70,986, 82,817, 94,648, 106,479, 118,310

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 2

Divisible by 4No, remainder 3

Divisible by 5No, remainder 1

Divisible by 6No, remainder 5

Divisible by 7No, remainder 1

Divisible by 8No, remainder 7

Divisible by 9No, remainder 5

Divisible by 10No, remainder 1

Divisible by 11No, remainder 6

Divisible by 12No, remainder 11

Divisible by 100No, remainder 31

Collatz (3n + 1) trajectory

Steps to reach 1174the total stopping time

Highest value reached575,72848× the starting value

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

First steps11,831 → 35,494 → 17,747 → 53,242 → 26,621 → 79,864 → 39,932 → 19,966 → 9,983 → 29,950 → …

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

As a percentage & fraction

As a percentage1,183,100%

11,831% as a decimal118.31

11,831% of 10011,831

11,831% of 1,000118,310

As a fraction of 10011,831/100

Read another way

As seconds3 hours, 17 minutes and 11 seconds

As bytes11.554 KiB

As a 24-bit colour#002E37

Keep nerding

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