Recognised as Number

30,709

Positive
Odd
Composite
5 digits

30,709 is an odd 5-digit integer and a composite number. It has 8 divisors and a digital root of 1.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value30,709

Digit count5

Digit sum19

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 numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation7 × 41 × 107

Distinct prime factors37, 41, 107

Number of divisors8

Sum of divisors σ(n)36,288

Aliquot sum5,579sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

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

SquarefreeYesno repeated prime factor

All divisors1, 7, 41, 107, 287, 749, 4,387, 30,7098 in total

Arithmetic

Previous number30,708

Next number30,710

Double61,418

Half15,354.5

Square943,042,681

Cube28,959,897,690,829

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

Cube root31.315202528≈

Negation-30,709

Reciprocal0.0000325637≈

Representations

Decimal30,709

Binary11101111111010115 bits

Octal73765

Hexadecimal77F5

Base 36NP1

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

In wordsthirty thousand, seven hundred and nine

Ordinalthirty thousand, seven hundred and ninth

Scientific notation3.0709 × 10^4

Engineering notation30.709 × 10^3

In other bases

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

Quinary1440314base 5; one hand: 7 digits

Septenary155350base 7: 6 digits

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

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

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

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

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

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

Bit-level

0111011111110101

Bit length15 bitsto write the magnitude

Set bits12the population count, or Hamming weight

Zero bits3within that length

Bit parityeven12 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

Bytes277 f5

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

At each machine width

16-bit0111011111110101

32-bit00000000000000000111011111110101

64-bit0000000000000000000000000000000000000000000000000111011111110101

One's complement1000100000001010at 16 bits, every bit flipped

Bits reversed1010111111101110at 16 bits

Rotated left by 11110111111101010at 16 bits, wrapping

Shifted left by 11110111111101010= 61,418, no wrap

Shifted right by 111101111111010= 15,354, discarding the low bit

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

Nearest landmarks

Next prime30,713+4

Previous prime30,707−2

Distance to nearest prime2

Nearest square below30,625

Nearest square above30,976

Powers & multiples

30,709 to the power 2943,042,681

30,709 to the power 328,959,897,690,829

30,709 to the power 4889,329,498,187,667,761

30,709 to the power 527,310,419,559,845,089,272,549

First ten multiples30,709, 61,418, 92,127, 122,836, 153,545, 184,254, 214,963, 245,672, 276,381, 307,090

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 5No, remainder 4

Divisible by 6No, remainder 1

Divisible by 7Yes

Divisible by 8No, remainder 5

Divisible by 9No, remainder 1

Divisible by 10No, remainder 9

Divisible by 11No, remainder 8

Divisible by 12No, remainder 1

Divisible by 100No, remainder 9

Collatz (3n + 1) trajectory

Steps to reach 1134the total stopping time

Highest value reached92,1283× the starting value

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

First steps30,709 → 92,128 → 46,064 → 23,032 → 11,516 → 5,758 → 2,879 → 8,638 → 4,319 → 12,958 → …

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

As a percentage & fraction

As a percentage3,070,900%

30,709% as a decimal307.09

30,709% of 10030,709

30,709% of 1,000307,090

As a fraction of 10030,709/100

Read another way

As seconds8 hours, 31 minutes and 49 seconds

As bytes29.989 KiB

As a 24-bit colour#0077F5

Keep nerding

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