Recognised as Number

31,439

Positive
Odd
Composite
5 digits

31,439 is an odd 5-digit integer and a composite number. It has 4 divisors and a digital root of 2.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value31,439

Digit count5

Digit sum20

Digit product324

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 factorisation149 × 211

Distinct prime factors2149, 211

Number of divisors4

Sum of divisors σ(n)31,800

Aliquot sum361sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)15,540the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 31,080

Möbius function μ(n)+12 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 149, 211, 31,4394 in total

Arithmetic

Previous number31,438

Next number31,440

Double62,878

Half15,719.5

Square988,410,721

Cube31,074,644,657,519

Square root177.310462184≈irrational, shown to 9 decimal places

Cube root31.561398681≈

Negation-31,439

Reciprocal0.0000318076≈

Representations

Decimal31,439

Binary11110101100111115 bits

Octal75317

Hexadecimal7ACF

Base 36O9B

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

In wordsthirty-one thousand, four hundred and thirty-nine

Ordinalthirty-one thousand, four hundred and thirty-ninth

Scientific notation3.1439 × 10^4

Engineering notation31.439 × 10^3

In other bases

Ternary1121010102base 3; the most digit-efficient integer base after e: 10 digits

Quinary2001224base 5; one hand: 7 digits

Septenary160442base 7: 6 digits

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

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

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

Sexagesimal8:43:59base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

0111101011001111

Bit length15 bitsto write the magnitude

Set bits11the population count, or Hamming weight

Zero bits4within that length

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

Highest set bitbit 14worth 16,384

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes27a cf

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

At each machine width

16-bit0111101011001111

32-bit00000000000000000111101011001111

64-bit0000000000000000000000000000000000000000000000000111101011001111

One's complement1000010100110000at 16 bits, every bit flipped

Bits reversed1111001101011110at 16 bits

Rotated left by 11111010110011110at 16 bits, wrapping

Shifted left by 11111010110011110= 62,878, no wrap

Shifted right by 111110101100111= 15,719, discarding the low bit

These bits as a double1.55329298 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime31,469+30

Previous prime31,397−42

Distance to nearest prime30

Nearest square below31,329

Nearest square above31,684

Powers & multiples

31,439 to the power 2988,410,721

31,439 to the power 331,074,644,657,519

31,439 to the power 4976,955,753,387,739,841

31,439 to the power 530,714,511,930,757,152,861,199

First ten multiples31,439, 62,878, 94,317, 125,756, 157,195, 188,634, 220,073, 251,512, 282,951, 314,390

Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 2

Divisible by 4No, remainder 3

Divisible by 5No, remainder 4

Divisible by 6No, remainder 5

Divisible by 7No, remainder 2

Divisible by 8No, remainder 7

Divisible by 9No, remainder 2

Divisible by 10No, remainder 9

Divisible by 11No, remainder 1

Divisible by 12No, remainder 11

Divisible by 100No, remainder 39

Collatz (3n + 1) trajectory

Steps to reach 1129the total stopping time

Highest value reached453,25614× the starting value

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

First steps31,439 → 94,318 → 47,159 → 141,478 → 70,739 → 212,218 → 106,109 → 318,328 → 159,164 → 79,582 → …

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

As a percentage & fraction

As a percentage3,143,900%

31,439% as a decimal314.39

31,439% of 10031,439

31,439% of 1,000314,390

As a fraction of 10031,439/100

Read another way

As seconds8 hours, 43 minutes and 59 seconds

As bytes30.702 KiB

As a 24-bit colour#007ACF

Keep nerding

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