Recognised as Number

30,927

Positive
Odd
Composite
5 digits

30,927 is an odd 5-digit integer and a composite number. It has 12 divisors and a digital root of 3.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value30,927

Digit count5

Digit sum21

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times 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 × 13^2 × 61

Distinct prime factors33, 13, 61

Number of divisors12

Sum of divisors σ(n)45,384

Aliquot sum14,457sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)780the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 18,720

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

SquarefreeNohas a repeated prime factor

All divisors1, 3, 13, 39, 61, 169, 183, 507, 793, 2,379, 10,309, 30,92712 in total

Arithmetic

Previous number30,926

Next number30,928

Double61,854

Half15,463.5

Square956,479,329

Cube29,581,036,207,983

Square root175.86074036≈irrational, shown to 9 decimal places

Cube root31.389128994≈

Negation-30,927

Reciprocal0.0000323342≈

Representations

Decimal30,927

Binary11110001100111115 bits

Octal74317

Hexadecimal78CF

Base 36NV3

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

In wordsthirty thousand, nine hundred and twenty-seven

Ordinalthirty thousand, nine hundred and twenty-seventh

Scientific notation3.0927 × 10^4

Engineering notation30.927 × 10^3

In other bases

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

Quinary1442202base 5; one hand: 7 digits

Septenary156111base 7: 6 digits

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

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

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

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

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

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

Bit-level

0111100011001111

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

Bytes278 cf

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

At each machine width

16-bit0111100011001111

32-bit00000000000000000111100011001111

64-bit0000000000000000000000000000000000000000000000000111100011001111

One's complement1000011100110000at 16 bits, every bit flipped

Bits reversed1111001100011110at 16 bits

Rotated left by 11111000110011110at 16 bits, wrapping

Shifted left by 11111000110011110= 61,854, no wrap

Shifted right by 111110001100111= 15,463, discarding the low bit

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

Nearest landmarks

Next prime30,931+4

Previous prime30,911−16

Distance to nearest prime4

Nearest square below30,625

Nearest square above30,976

Powers & multiples

30,927 to the power 2956,479,329

30,927 to the power 329,581,036,207,983

30,927 to the power 4914,852,706,804,290,241

30,927 to the power 528,293,649,663,336,284,283,407

First ten multiples30,927, 61,854, 92,781, 123,708, 154,635, 185,562, 216,489, 247,416, 278,343, 309,270

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 2

Divisible by 6No, remainder 3

Divisible by 7No, remainder 1

Divisible by 8No, remainder 7

Divisible by 9No, remainder 3

Divisible by 10No, remainder 7

Divisible by 11No, remainder 6

Divisible by 12No, remainder 3

Divisible by 100No, remainder 27

Collatz (3n + 1) trajectory

Steps to reach 1134the total stopping time

Highest value reached445,87614× the starting value

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

First steps30,927 → 92,782 → 46,391 → 139,174 → 69,587 → 208,762 → 104,381 → 313,144 → 156,572 → 78,286 → …

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

As a percentage & fraction

As a percentage3,092,700%

30,927% as a decimal309.27

30,927% of 10030,927

30,927% of 1,000309,270

As a fraction of 10030,927/100

Read another way

As seconds8 hours, 35 minutes and 27 seconds

As bytes30.202 KiB

As a 24-bit colour#0078CF

Keep nerding

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