Recognised as Number

31,505

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value31,505

Digit count5

Digit sum14

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times 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 factorisation5 × 6,301

Distinct prime factors25, 6,301

Number of divisors4

Sum of divisors σ(n)37,812

Aliquot sum6,307sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)6,300the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 25,200

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

SquarefreeYesno repeated prime factor

All divisors1, 5, 6,301, 31,5054 in total

Arithmetic

Previous number31,504

Next number31,506

Double63,010

Half15,752.5

Square992,565,025

Cube31,270,761,112,625

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

Cube root31.583468894≈

Negation-31,505

Reciprocal0.000031741≈

Representations

Decimal31,505

Binary11110110001000115 bits

Octal75421

Hexadecimal7B11

Base 36OB5

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

In wordsthirty-one thousand, five hundred and five

Ordinalthirty-one thousand, five hundred and fifth

Scientific notation3.1505 × 10^4

Engineering notation31.505 × 10^3

In other bases

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

Quinary2002010base 5; one hand: 7 digits

Septenary160565base 7: 6 digits

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

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

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

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

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

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

Bit-level

0111101100010001

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 odd

Highest set bitbit 14worth 16,384

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes27b 11

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

At each machine width

16-bit0111101100010001

32-bit00000000000000000111101100010001

64-bit0000000000000000000000000000000000000000000000000111101100010001

One's complement1000010011101110at 16 bits, every bit flipped

Bits reversed1000100011011110at 16 bits

Rotated left by 11111011000100010at 16 bits, wrapping

Shifted left by 11111011000100010= 63,010, no wrap

Shifted right by 111110110001000= 15,752, discarding the low bit

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

Nearest landmarks

Next prime31,511+6

Previous prime31,489−16

Distance to nearest prime6

Nearest square below31,329

Nearest square above31,684

Powers & multiples

31,505 to the power 2992,565,025

31,505 to the power 331,270,761,112,625

31,505 to the power 4985,185,328,853,250,625

31,505 to the power 531,038,263,785,521,660,940,625

First ten multiples31,505, 63,010, 94,515, 126,020, 157,525, 189,030, 220,535, 252,040, 283,545, 315,050

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 5Yes

Divisible by 6No, remainder 5

Divisible by 7No, remainder 5

Divisible by 8No, remainder 1

Divisible by 9No, remainder 5

Divisible by 10No, remainder 5

Divisible by 11No, remainder 1

Divisible by 12No, remainder 5

Divisible by 100No, remainder 5

Collatz (3n + 1) trajectory

Steps to reach 1129the total stopping time

Highest value reached345,54410× the starting value

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

First steps31,505 → 94,516 → 47,258 → 23,629 → 70,888 → 35,444 → 17,722 → 8,861 → 26,584 → 13,292 → …

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

As a percentage & fraction

As a percentage3,150,500%

31,505% as a decimal315.05

31,505% of 10031,505

31,505% of 1,000315,050

As a fraction of 10031,505/100

Read another way

As seconds8 hours, 45 minutes and 5 seconds

As bytes30.767 KiB

As a 24-bit colour#007B11

Keep nerding

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