Recognised as Number

30,707

Positive
Odd
Prime
5 digits

30,707 is an odd 5-digit integer and a prime number. It has 2 divisors and a digital root of 8.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value30,707

Digit count5

Digit sum17

Digit product0zero, because one of the digits is zero

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

Digital root8repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation30,707

Distinct prime factors130,707

Number of divisors2

Sum of divisors σ(n)30,708

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)30,706the smallest exponent with aˣ ≡ 1 for every unit coprime to n

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

SquarefreeYesno repeated prime factor

All divisors1, 30,7072 in total

Arithmetic

Previous number30,706

Next number30,708

Double61,414

Half15,353.5

Square942,919,849

Cube28,954,239,803,243

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

Cube root31.314522687≈

Negation-30,707

Reciprocal0.0000325659≈

Representations

Decimal30,707

Binary11101111111001115 bits

Octal73763

Hexadecimal77F3

Base 36NOZ

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

In wordsthirty thousand, seven hundred and seven

Ordinalthirty thousand, seven hundred and seventh

Scientific notation3.0707 × 10^4

Engineering notation30.707 × 10^3

In other bases

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

Quinary1440312base 5; one hand: 7 digits

Septenary155345base 7: 6 digits

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

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

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

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

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

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

Bit-level

0111011111110011

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 f3

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

At each machine width

16-bit0111011111110011

32-bit00000000000000000111011111110011

64-bit0000000000000000000000000000000000000000000000000111011111110011

One's complement1000100000001100at 16 bits, every bit flipped

Bits reversed1100111111101110at 16 bits

Rotated left by 11110111111100110at 16 bits, wrapping

Shifted left by 11110111111100110= 61,414, no wrap

Shifted right by 111101111111001= 15,353, discarding the low bit

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

Nearest landmarks

Next prime30,713+6

Previous prime30,703−4

Distance to nearest prime0, it is prime

Nearest square below30,625

Nearest square above30,976

Powers & multiples

30,707 to the power 2942,919,849

30,707 to the power 328,954,239,803,243

30,707 to the power 4889,097,841,638,182,801

30,707 to the power 527,301,527,423,183,679,270,307

First ten multiples30,707, 61,414, 92,121, 122,828, 153,535, 184,242, 214,949, 245,656, 276,363, 307,070

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 3

Divisible by 5No, remainder 2

Divisible by 6No, remainder 5

Divisible by 7No, remainder 5

Divisible by 8No, remainder 3

Divisible by 9No, remainder 8

Divisible by 10No, remainder 7

Divisible by 11No, remainder 6

Divisible by 12No, remainder 11

Divisible by 100No, remainder 7

Collatz (3n + 1) trajectory

Steps to reach 1116the total stopping time

Highest value reached560,35618× the starting value

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

First steps30,707 → 92,122 → 46,061 → 138,184 → 69,092 → 34,546 → 17,273 → 51,820 → 25,910 → 12,955 → …

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

As a percentage & fraction

As a percentage3,070,700%

30,707% as a decimal307.07

30,707% of 10030,707

30,707% of 1,000307,070

As a fraction of 10030,707/100

Read another way

As seconds8 hours, 31 minutes and 47 seconds

As bytes29.987 KiB

As a 24-bit colour#0077F3

Keep nerding

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