Recognised as Number

31,437

Positive
Odd
Composite
5 digits

31,437 is an odd 5-digit integer and a composite number. It has 12 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value31,437

Digit count5

Digit sum18

Digit product252

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

Digital root9repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3^2 × 7 × 499

Distinct prime factors33, 7, 499

Number of divisors12

Sum of divisors σ(n)52,000

Aliquot sum20,563sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)498the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 17,928

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

SquarefreeNohas a repeated prime factor

All divisors1, 3, 7, 9, 21, 63, 499, 1,497, 3,493, 4,491, 10,479, 31,43712 in total

Arithmetic

Previous number31,436

Next number31,438

Double62,874

Half15,718.5

Square988,284,969

Cube31,068,714,570,453

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

Cube root31.560729404≈

Negation-31,437

Reciprocal0.0000318097≈

Representations

Decimal31,437

Binary11110101100110115 bits

Octal75315

Hexadecimal7ACD

Base 36O99

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

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

Ordinalthirty-one thousand, four hundred and thirty-seventh

Scientific notation3.1437 × 10^4

Engineering notation31.437 × 10^3

In other bases

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

Quinary2001222base 5; one hand: 7 digits

Septenary160440base 7: 6 digits

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

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

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

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

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

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

Bit-level

0111101011001101

Bit length15 bitsto write the magnitude

Set bits10the population count, or Hamming weight

Zero bits5within that length

Bit parityeven10 set bits, so even; 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 cd

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

At each machine width

16-bit0111101011001101

32-bit00000000000000000111101011001101

64-bit0000000000000000000000000000000000000000000000000111101011001101

One's complement1000010100110010at 16 bits, every bit flipped

Bits reversed1011001101011110at 16 bits

Rotated left by 11111010110011010at 16 bits, wrapping

Shifted left by 11111010110011010= 62,874, no wrap

Shifted right by 111110101100110= 15,718, discarding the low bit

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

Nearest landmarks

Next prime31,469+32

Previous prime31,397−40

Distance to nearest prime32

Nearest square below31,329

Nearest square above31,684

Powers & multiples

31,437 to the power 2988,284,969

31,437 to the power 331,068,714,570,453

31,437 to the power 4976,707,179,951,330,961

31,437 to the power 530,704,743,616,129,991,420,957

First ten multiples31,437, 62,874, 94,311, 125,748, 157,185, 188,622, 220,059, 251,496, 282,933, 314,370

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 1

Divisible by 5No, remainder 2

Divisible by 6No, remainder 3

Divisible by 7Yes

Divisible by 8No, remainder 5

Divisible by 9Yes

Divisible by 10No, remainder 7

Divisible by 11No, remainder 10

Divisible by 12No, remainder 9

Divisible by 100No, remainder 37

Collatz (3n + 1) trajectory

Steps to reach 1103the total stopping time

Highest value reached94,3123× the starting value

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

First steps31,437 → 94,312 → 47,156 → 23,578 → 11,789 → 35,368 → 17,684 → 8,842 → 4,421 → 13,264 → …

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

As a percentage & fraction

As a percentage3,143,700%

31,437% as a decimal314.37

31,437% of 10031,437

31,437% of 1,000314,370

As a fraction of 10031,437/100

Read another way

As seconds8 hours, 43 minutes and 57 seconds

As bytes30.7 KiB

As a 24-bit colour#007ACD

Keep nerding

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