Recognised as Number

30,697

Positive
Odd
Prime
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value30,697

Digit count5

Digit sum25

Digit product0zero, because one of the digits is zero

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

Digital root7repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation30,697

Distinct prime factors130,697

Number of divisors2

Sum of divisors σ(n)30,698

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

Arithmetic

Previous number30,696

Next number30,698

Double61,394

Half15,348.5

Square942,305,809

Cube28,925,961,418,873

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

Cube root31.311123036≈

Negation-30,697

Reciprocal0.0000325765≈

Representations

Decimal30,697

Binary11101111110100115 bits

Octal73751

Hexadecimal77E9

Base 36NOP

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

In wordsthirty thousand, six hundred and ninety-seven

Ordinalthirty thousand, six hundred and ninety-seventh

Scientific notation3.0697 × 10^4

Engineering notation30.697 × 10^3

In other bases

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

Quinary1440242base 5; one hand: 7 digits

Septenary155332base 7: 6 digits

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

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

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

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

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

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

Bit-level

0111011111101001

Bit length15 bitsto write the magnitude

Set bits11the population count, or Hamming weight

Zero bits4within that length

Bit parityodd11 set bits, so odd; 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 e9

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

At each machine width

16-bit0111011111101001

32-bit00000000000000000111011111101001

64-bit0000000000000000000000000000000000000000000000000111011111101001

One's complement1000100000010110at 16 bits, every bit flipped

Bits reversed1001011111101110at 16 bits

Rotated left by 11110111111010010at 16 bits, wrapping

Shifted left by 11110111111010010= 61,394, no wrap

Shifted right by 111101111110100= 15,348, discarding the low bit

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

Nearest landmarks

Next prime30,703+6

Previous prime30,689−8

Distance to nearest prime0, it is prime

Nearest square below30,625

Nearest square above30,976

Powers & multiples

30,697 to the power 2942,305,809

30,697 to the power 328,925,961,418,873

30,697 to the power 4887,940,237,675,144,481

30,697 to the power 527,257,101,475,913,910,133,257

First ten multiples30,697, 61,394, 92,091, 122,788, 153,485, 184,182, 214,879, 245,576, 276,273, 306,970

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 2

Divisible by 6No, remainder 1

Divisible by 7No, remainder 2

Divisible by 8No, remainder 1

Divisible by 9No, remainder 7

Divisible by 10No, remainder 7

Divisible by 11No, remainder 7

Divisible by 12No, remainder 1

Divisible by 100No, remainder 97

Collatz (3n + 1) trajectory

Steps to reach 1116the total stopping time

Highest value reached442,56414× the starting value

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

First steps30,697 → 92,092 → 46,046 → 23,023 → 69,070 → 34,535 → 103,606 → 51,803 → 155,410 → 77,705 → …

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

As a percentage & fraction

As a percentage3,069,700%

30,697% as a decimal306.97

30,697% of 10030,697

30,697% of 1,000306,970

As a fraction of 10030,697/100

Read another way

As seconds8 hours, 31 minutes and 37 seconds

As bytes29.978 KiB

As a 24-bit colour#0077E9

Keep nerding

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