Recognised as Number

31,442

Positive
Even
Composite
5 digits

31,442 is an even 5-digit integer and a composite number. It has 8 divisors and a digital root of 5.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value31,442

Digit count5

Digit sum14

Digit product96

Multiplicative persistence4times 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 factorisation2 × 79 × 199

Distinct prime factors32, 79, 199

Number of divisors8

Sum of divisors σ(n)48,000

Aliquot sum16,558sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

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

SquarefreeYesno repeated prime factor

All divisors1, 2, 79, 158, 199, 398, 15,721, 31,4428 in total

Arithmetic

Previous number31,441

Next number31,443

Double62,884

Half15,721

Square988,599,364

Cube31,083,541,202,888

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

Cube root31.562402542≈

Negation-31,442

Reciprocal0.0000318046≈

Representations

Decimal31,442

Binary11110101101001015 bits

Octal75322

Hexadecimal7AD2

Base 36O9E

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

In wordsthirty-one thousand, four hundred and forty-two

Ordinalthirty-one thousand, four hundred and forty-second

Scientific notation3.1442 × 10^4

Engineering notation31.442 × 10^3

In other bases

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

Quinary2001232base 5; one hand: 7 digits

Septenary160445base 7: 6 digits

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

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

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

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

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

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

Bit-level

0111101011010010

Bit length15 bitsto write the magnitude

Set bits9the population count, or Hamming weight

Zero bits6within that length

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

Highest set bitbit 14worth 16,384

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes27a d2

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

At each machine width

16-bit0111101011010010

32-bit00000000000000000111101011010010

64-bit0000000000000000000000000000000000000000000000000111101011010010

One's complement1000010100101101at 16 bits, every bit flipped

Bits reversed0100101101011110at 16 bits

Rotated left by 11111010110100100at 16 bits, wrapping

Shifted left by 11111010110100100= 62,884, no wrap

Shifted right by 111110101101001= 15,721, discarding the low bit

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

Nearest landmarks

Next prime31,469+27

Previous prime31,397−45

Distance to nearest prime27

Nearest square below31,329

Nearest square above31,684

Powers & multiples

31,442 to the power 2988,599,364

31,442 to the power 331,083,541,202,888

31,442 to the power 4977,328,702,501,204,496

31,442 to the power 530,729,169,064,042,871,763,232

First ten multiples31,442, 62,884, 94,326, 125,768, 157,210, 188,652, 220,094, 251,536, 282,978, 314,420

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

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 2

Divisible by 4No, remainder 2

Divisible by 5No, remainder 2

Divisible by 6No, remainder 2

Divisible by 7No, remainder 5

Divisible by 8No, remainder 2

Divisible by 9No, remainder 5

Divisible by 10No, remainder 2

Divisible by 11No, remainder 4

Divisible by 12No, remainder 2

Divisible by 100No, remainder 42

Collatz (3n + 1) trajectory

Steps to reach 185the total stopping time

Highest value reached119,3923× the starting value

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

First steps31,442 → 15,721 → 47,164 → 23,582 → 11,791 → 35,374 → 17,687 → 53,062 → 26,531 → 79,594 → …

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

As a percentage & fraction

As a percentage3,144,200%

31,442% as a decimal314.42

31,442% of 10031,442

31,442% of 1,000314,420

As a fraction of 10031,442/100

Read another way

As seconds8 hours, 44 minutes and 2 seconds

As bytes30.705 KiB

As a 24-bit colour#007AD2

Keep nerding

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