Recognised as Number

30,713

Positive
Odd
Prime
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value30,713

Digit count5

Digit sum14

Digit product0zero, because one of the digits is zero

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

Digital root5repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation30,713

Distinct prime factors130,713

Number of divisors2

Sum of divisors σ(n)30,714

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)30,712the 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,7132 in total

Arithmetic

Previous number30,712

Next number30,714

Double61,426

Half15,356.5

Square943,288,369

Cube28,971,215,677,097

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

Cube root31.316562123≈

Negation-30,713

Reciprocal0.0000325595≈

Representations

Decimal30,713

Binary11101111111100115 bits

Octal73771

Hexadecimal77F9

Base 36NP5

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

In wordsthirty thousand, seven hundred and thirteen

Ordinalthirty thousand, seven hundred and thirteenth

Scientific notation3.0713 × 10^4

Engineering notation30.713 × 10^3

In other bases

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

Quinary1440323base 5; one hand: 7 digits

Septenary155354base 7: 6 digits

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

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

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

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

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

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

Bit-level

0111011111111001

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 f9

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

At each machine width

16-bit0111011111111001

32-bit00000000000000000111011111111001

64-bit0000000000000000000000000000000000000000000000000111011111111001

One's complement1000100000000110at 16 bits, every bit flipped

Bits reversed1001111111101110at 16 bits

Rotated left by 11110111111110010at 16 bits, wrapping

Shifted left by 11110111111110010= 61,426, no wrap

Shifted right by 111101111111100= 15,356, discarding the low bit

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

Nearest landmarks

Next prime30,727+14

Previous prime30,707−6

Distance to nearest prime0, it is prime

Nearest square below30,625

Nearest square above30,976

Powers & multiples

30,713 to the power 2943,288,369

30,713 to the power 328,971,215,677,097

30,713 to the power 4889,792,947,090,680,161

30,713 to the power 527,328,210,783,996,059,784,793

First ten multiples30,713, 61,426, 92,139, 122,852, 153,565, 184,278, 214,991, 245,704, 276,417, 307,130

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 1

Divisible by 5No, remainder 3

Divisible by 6No, remainder 5

Divisible by 7No, remainder 4

Divisible by 8No, remainder 1

Divisible by 9No, remainder 5

Divisible by 10No, remainder 3

Divisible by 11No, remainder 1

Divisible by 12No, remainder 5

Divisible by 100No, remainder 13

Collatz (3n + 1) trajectory

Steps to reach 159the total stopping time

Highest value reached131,2004× the starting value

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

First steps30,713 → 92,140 → 46,070 → 23,035 → 69,106 → 34,553 → 103,660 → 51,830 → 25,915 → 77,746 → …

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

As a percentage & fraction

As a percentage3,071,300%

30,713% as a decimal307.13

30,713% of 10030,713

30,713% of 1,000307,130

As a fraction of 10030,713/100

Read another way

As seconds8 hours, 31 minutes and 53 seconds

As bytes29.993 KiB

As a 24-bit colour#0077F9

Keep nerding

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