Recognised as Number

31,105

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value31,105

Digit count5

Digit sum10

Digit product0zero, because one of the digits is zero

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

Digital root1repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation5 × 6,221

Distinct prime factors25, 6,221

Number of divisors4

Sum of divisors σ(n)37,332

Aliquot sum6,227sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

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

SquarefreeYesno repeated prime factor

All divisors1, 5, 6,221, 31,1054 in total

Arithmetic

Previous number31,104

Next number31,106

Double62,210

Half15,552.5

Square967,521,025

Cube30,094,741,482,625

Square root176.366096515≈irrational, shown to 9 decimal places

Cube root31.449233756≈

Negation-31,105

Reciprocal0.0000321492≈

Representations

Decimal31,105

Binary11110011000000115 bits

Octal74601

Hexadecimal7981

Base 36O01

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

In wordsthirty-one thousand, one hundred and five

Ordinalthirty-one thousand, one hundred and fifth

Scientific notation3.1105 × 10^4

Engineering notation31.105 × 10^3

In other bases

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

Quinary1443410base 5; one hand: 7 digits

Septenary156454base 7: 6 digits

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

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

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

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

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

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

Bit-level

0111100110000001

Bit length15 bitsto write the magnitude

Set bits7the population count, or Hamming weight

Zero bits8within that length

Bit parityodd7 set bits, so odd; not the same as the number itself being odd

Highest set bitbit 14worth 16,384

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes279 81

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

At each machine width

16-bit0111100110000001

32-bit00000000000000000111100110000001

64-bit0000000000000000000000000000000000000000000000000111100110000001

One's complement1000011001111110at 16 bits, every bit flipped

Bits reversed1000000110011110at 16 bits

Rotated left by 11111001100000010at 16 bits, wrapping

Shifted left by 11111001100000010= 62,210, no wrap

Shifted right by 111110011000000= 15,552, discarding the low bit

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

Nearest landmarks

Next prime31,121+16

Previous prime31,091−14

Distance to nearest prime14

Nearest square below30,976

Nearest square above31,329

Powers & multiples

31,105 to the power 2967,521,025

31,105 to the power 330,094,741,482,625

31,105 to the power 4936,096,933,817,050,625

31,105 to the power 529,117,295,126,379,359,690,625

First ten multiples31,105, 62,210, 93,315, 124,420, 155,525, 186,630, 217,735, 248,840, 279,945, 311,050

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 1

Divisible by 5Yes

Divisible by 6No, remainder 1

Divisible by 7No, remainder 4

Divisible by 8No, remainder 1

Divisible by 9No, remainder 1

Divisible by 10No, remainder 5

Divisible by 11No, remainder 8

Divisible by 12No, remainder 1

Divisible by 100No, remainder 5

Collatz (3n + 1) trajectory

Steps to reach 185the total stopping time

Highest value reached93,3163× the starting value

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

First steps31,105 → 93,316 → 46,658 → 23,329 → 69,988 → 34,994 → 17,497 → 52,492 → 26,246 → 13,123 → …

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

As a percentage & fraction

As a percentage3,110,500%

31,105% as a decimal311.05

31,105% of 10031,105

31,105% of 1,000311,050

As a fraction of 10031,105/100

Read another way

As seconds8 hours, 38 minutes and 25 seconds

As bytes30.376 KiB

As a 24-bit colour#007981

Keep nerding

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