Recognised as Number

31,349

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value31,349

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 factorisation23 × 29 × 47

Distinct prime factors323, 29, 47

Number of divisors8

Sum of divisors σ(n)34,560

Aliquot sum3,211sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)7,084the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 28,336

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

SquarefreeYesno repeated prime factor

All divisors1, 23, 29, 47, 667, 1,081, 1,363, 31,3498 in total

Arithmetic

Previous number31,348

Next number31,350

Double62,698

Half15,674.5

Square982,759,801

Cube30,808,537,001,549

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

Cube root31.5312531≈

Negation-31,349

Reciprocal0.0000318989≈

Representations

Decimal31,349

Binary11110100111010115 bits

Octal75165

Hexadecimal7A75

Base 36O6T

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

In wordsthirty-one thousand, three hundred and forty-nine

Ordinalthirty-one thousand, three hundred and forty-ninth

Scientific notation3.1349 × 10^4

Engineering notation31.349 × 10^3

In other bases

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

Quinary2000344base 5; one hand: 7 digits

Septenary160253base 7: 6 digits

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

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

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

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

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

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

Bit-level

0111101001110101

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 75

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

At each machine width

16-bit0111101001110101

32-bit00000000000000000111101001110101

64-bit0000000000000000000000000000000000000000000000000111101001110101

One's complement1000010110001010at 16 bits, every bit flipped

Bits reversed1010111001011110at 16 bits

Rotated left by 11111010011101010at 16 bits, wrapping

Shifted left by 11111010011101010= 62,698, no wrap

Shifted right by 111110100111010= 15,674, discarding the low bit

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

Nearest landmarks

Next prime31,357+8

Previous prime31,337−12

Distance to nearest prime8

Nearest square below31,329

Nearest square above31,684

Powers & multiples

31,349 to the power 2982,759,801

31,349 to the power 330,808,537,001,549

31,349 to the power 4965,816,826,461,559,601

31,349 to the power 530,277,391,692,743,431,931,749

First ten multiples31,349, 62,698, 94,047, 125,396, 156,745, 188,094, 219,443, 250,792, 282,141, 313,490

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 1

Divisible by 5No, remainder 4

Divisible by 6No, remainder 5

Divisible by 7No, remainder 3

Divisible by 8No, remainder 5

Divisible by 9No, remainder 2

Divisible by 10No, remainder 9

Divisible by 11No, remainder 10

Divisible by 12No, remainder 5

Divisible by 100No, remainder 49

Collatz (3n + 1) trajectory

Steps to reach 185the total stopping time

Highest value reached94,0483× the starting value

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

First steps31,349 → 94,048 → 47,024 → 23,512 → 11,756 → 5,878 → 2,939 → 8,818 → 4,409 → 13,228 → …

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

As a percentage & fraction

As a percentage3,134,900%

31,349% as a decimal313.49

31,349% of 10031,349

31,349% of 1,000313,490

As a fraction of 10031,349/100

Read another way

As seconds8 hours, 42 minutes and 29 seconds

As bytes30.614 KiB

As a 24-bit colour#007A75

Keep nerding

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