Recognised as Number

31,431

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value31,431

Digit count5

Digit sum12

Digit product36

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

Digital root3repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 10,477

Distinct prime factors23, 10,477

Number of divisors4

Sum of divisors σ(n)41,912

Aliquot sum10,481sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)10,476the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 20,952

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

SquarefreeYesno repeated prime factor

All divisors1, 3, 10,477, 31,4314 in total

Arithmetic

Previous number31,430

Next number31,432

Double62,862

Half15,715.5

Square987,907,761

Cube31,050,928,835,991

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

Cube root31.558721405≈

Negation-31,431

Reciprocal0.0000318157≈

Representations

Decimal31,431

Binary11110101100011115 bits

Octal75307

Hexadecimal7AC7

Base 36O93

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

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

Ordinalthirty-one thousand, four hundred and thirty-first

Scientific notation3.1431 × 10^4

Engineering notation31.431 × 10^3

In other bases

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

Quinary2001211base 5; one hand: 7 digits

Septenary160431base 7: 6 digits

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

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

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

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

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

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

Bit-level

0111101011000111

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 c7

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

At each machine width

16-bit0111101011000111

32-bit00000000000000000111101011000111

64-bit0000000000000000000000000000000000000000000000000111101011000111

One's complement1000010100111000at 16 bits, every bit flipped

Bits reversed1110001101011110at 16 bits

Rotated left by 11111010110001110at 16 bits, wrapping

Shifted left by 11111010110001110= 62,862, no wrap

Shifted right by 111110101100011= 15,715, discarding the low bit

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

Nearest landmarks

Next prime31,469+38

Previous prime31,397−34

Distance to nearest prime34

Nearest square below31,329

Nearest square above31,684

Powers & multiples

31,431 to the power 2987,907,761

31,431 to the power 331,050,928,835,991

31,431 to the power 4975,961,744,244,033,121

31,431 to the power 530,675,453,583,334,205,026,151

First ten multiples31,431, 62,862, 94,293, 125,724, 157,155, 188,586, 220,017, 251,448, 282,879, 314,310

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 3

Divisible by 5No, remainder 1

Divisible by 6No, remainder 3

Divisible by 7No, remainder 1

Divisible by 8No, remainder 7

Divisible by 9No, remainder 3

Divisible by 10No, remainder 1

Divisible by 11No, remainder 4

Divisible by 12No, remainder 3

Divisible by 100No, remainder 31

Collatz (3n + 1) trajectory

Steps to reach 185the total stopping time

Highest value reached212,1646× the starting value

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

First steps31,431 → 94,294 → 47,147 → 141,442 → 70,721 → 212,164 → 106,082 → 53,041 → 159,124 → 79,562 → …

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

As a percentage & fraction

As a percentage3,143,100%

31,431% as a decimal314.31

31,431% of 10031,431

31,431% of 1,000314,310

As a fraction of 10031,431/100

Read another way

As seconds8 hours, 43 minutes and 51 seconds

As bytes30.694 KiB

As a 24-bit colour#007AC7

Keep nerding

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