Recognised as Number

31,410

Positive
Even
Composite
5 digits

31,410 is an even 5-digit integer and a composite number. It has 24 divisors and a digital root of 9.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value31,410

Digit count5

Digit sum9

Digit product0zero, because one of the digits is zero

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

Digital root9repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberYesdivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 3^2 × 5 × 349

Distinct prime factors42, 3, 5, 349

Number of divisors24

Sum of divisors σ(n)81,900

Aliquot sum50,490sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

Carmichael function λ(n)348the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 8,352

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 3, 5, 6, 9, 10, 15, 18, 30, 45, 90, 349, 698, 1,047, 1,745, 2,094, 3,141, 3,490, 5,235, 6,282, 10,470, 15,705, 31,41024 in total

Arithmetic

Previous number31,409

Next number31,411

Double62,820

Half15,705

Square986,588,100

Cube30,988,732,221,000

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

Cube root31.551691394≈

Negation-31,410

Reciprocal0.000031837≈

Representations

Decimal31,410

Binary11110101011001015 bits

Octal75262

Hexadecimal7AB2

Base 36O8I

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

In wordsthirty-one thousand, four hundred and ten

Ordinalthirty-one thousand, four hundred and tenth

Scientific notation3.141 × 10^4

Engineering notation31.41 × 10^3

In other bases

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

Quinary2001120base 5; one hand: 7 digits

Septenary160401base 7: 6 digits

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

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

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

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

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

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

Bit-level

0111101010110010

Bit length15 bitsto write the magnitude

Set bits9the population count, or Hamming weight

Zero bits6within that length

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

Highest set bitbit 14worth 16,384

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes27a b2

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

At each machine width

16-bit0111101010110010

32-bit00000000000000000111101010110010

64-bit0000000000000000000000000000000000000000000000000111101010110010

One's complement1000010101001101at 16 bits, every bit flipped

Bits reversed0100110101011110at 16 bits

Rotated left by 11111010101100100at 16 bits, wrapping

Shifted left by 11111010101100100= 62,820, no wrap

Shifted right by 111110101011001= 15,705, discarding the low bit

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

Nearest landmarks

Next prime31,469+59

Previous prime31,397−13

Distance to nearest prime13

Nearest square below31,329

Nearest square above31,684

Powers & multiples

31,410 to the power 2986,588,100

31,410 to the power 330,988,732,221,000

31,410 to the power 4973,356,079,061,610,000

31,410 to the power 530,573,114,443,325,170,100,000

First ten multiples31,410, 62,820, 94,230, 125,640, 157,050, 188,460, 219,870, 251,280, 282,690, 314,100

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

Divisibility tests

Divisible by 2Yes

Divisible by 3Yes

Divisible by 4No, remainder 2

Divisible by 5Yes

Divisible by 6Yes

Divisible by 7No, remainder 1

Divisible by 8No, remainder 2

Divisible by 9Yes

Divisible by 10Yes

Divisible by 11No, remainder 5

Divisible by 12No, remainder 6

Divisible by 100No, remainder 10

Collatz (3n + 1) trajectory

Steps to reach 1103the total stopping time

Highest value reached53,0081× the starting value

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

First steps31,410 → 15,705 → 47,116 → 23,558 → 11,779 → 35,338 → 17,669 → 53,008 → 26,504 → 13,252 → …

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

As a percentage & fraction

As a percentage3,141,000%

31,410% as a decimal314.1

31,410% of 10031,410

31,410% of 1,000314,100

As a fraction of 10031,410/100

Read another way

As seconds8 hours, 43 minutes and 30 seconds

As bytes30.674 KiB

As a 24-bit colour#007AB2

Keep nerding

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