Recognised as Number

31,432

Positive
Even
Composite
5 digits

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

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value31,432

Digit count5

Digit sum13

Digit product72

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

Digital root4repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^3 × 3,929

Distinct prime factors22, 3,929

Number of divisors8

Sum of divisors σ(n)58,950

Aliquot sum27,518sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 4, 8, 3,929, 7,858, 15,716, 31,4328 in total

Arithmetic

Previous number31,431

Next number31,433

Double62,864

Half15,716

Square987,970,624

Cube31,053,892,653,568

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

Cube root31.559056089≈

Negation-31,432

Reciprocal0.0000318147≈

Representations

Decimal31,432

Binary11110101100100015 bits

Octal75310

Hexadecimal7AC8

Base 36O94

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

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

Ordinalthirty-one thousand, four hundred and thirty-second

Scientific notation3.1432 × 10^4

Engineering notation31.432 × 10^3

In other bases

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

Quinary2001212base 5; one hand: 7 digits

Septenary160432base 7: 6 digits

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

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

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

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

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

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

Bit-level

0111101011001000

Bit length15 bitsto write the magnitude

Set bits8the population count, or Hamming weight

Zero bits7within that length

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

Highest set bitbit 14worth 16,384

Lowest set bitbit 33 trailing zeros

Power of twoNo

Bytes27a c8

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

At each machine width

16-bit0111101011001000

32-bit00000000000000000111101011001000

64-bit0000000000000000000000000000000000000000000000000111101011001000

One's complement1000010100110111at 16 bits, every bit flipped

Bits reversed0001001101011110at 16 bits

Rotated left by 11111010110010000at 16 bits, wrapping

Shifted left by 11111010110010000= 62,864, no wrap

Shifted right by 111110101100100= 15,716, discarding the low bit

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

Nearest landmarks

Next prime31,469+37

Previous prime31,397−35

Distance to nearest prime35

Nearest square below31,329

Nearest square above31,684

Powers & multiples

31,432 to the power 2987,970,624

31,432 to the power 331,053,892,653,568

31,432 to the power 4976,085,953,886,949,376

31,432 to the power 530,680,333,702,574,592,786,432

First ten multiples31,432, 62,864, 94,296, 125,728, 157,160, 188,592, 220,024, 251,456, 282,888, 314,320

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

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 1

Divisible by 4Yes

Divisible by 5No, remainder 2

Divisible by 6No, remainder 4

Divisible by 7No, remainder 2

Divisible by 8Yes

Divisible by 9No, remainder 4

Divisible by 10No, remainder 2

Divisible by 11No, remainder 5

Divisible by 12No, remainder 4

Divisible by 100No, remainder 32

Collatz (3n + 1) trajectory

Steps to reach 1103the total stopping time

Highest value reached31,432

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

First steps31,432 → 15,716 → 7,858 → 3,929 → 11,788 → 5,894 → 2,947 → 8,842 → 4,421 → 13,264 → …

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

As a percentage & fraction

As a percentage3,143,200%

31,432% as a decimal314.32

31,432% of 10031,432

31,432% of 1,000314,320

As a fraction of 10031,432/100

Read another way

As seconds8 hours, 43 minutes and 52 seconds

As bytes30.695 KiB

As a 24-bit colour#007AC8

Keep nerding

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