Nerdulator> put something in

Recognised as Number

30,307

  • Positive
  • Odd
  • Prime
  • 5 digits

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

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value30,307
Digit count5
Digit sum13
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation30,307
Distinct prime factors130,307
Number of divisors2
Sum of divisors σ(n)30,308
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)30,306integers below n that share no factor with it
Carmichael function λ(n)30,306the 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,3072 in total

Arithmetic

Previous number30,306
Next number30,308
Double60,614
Square root174.089057669≈irrational, shown to 9 decimal places
Cube root31.177956707≈
Negation-30,307
Reciprocal0.0000329957≈

Representations

Decimal30,307
Binary11101100110001115 bits
Octal73143
Hexadecimal7663
Base 36NDV
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthirty thousand, three hundred and seven
Ordinalthirty thousand, three hundred and seventh
Scientific notation3.0307 × 10^4
Engineering notation30.307 × 10^3

In other bases

Ternary1112120111base 3; the most digit-efficient integer base after e: 10 digits
Quinary1432212base 5; one hand: 7 digits
Septenary154234base 7: 6 digits
Nonary45514base 9; each digit is two ternary digits: 5 digits
Duodecimal15657base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal3ff7base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal8:25:7base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1TTT0TT0111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000101110100111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

0111011001100011
Bit length15 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits6within that length
Bit parityodd9 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
Bytes276 63
Gray code100110101010010n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0111011001100011
32-bit00000000000000000111011001100011
64-bit0000000000000000000000000000000000000000000000000111011001100011
One's complement1000100110011100at 16 bits, every bit flipped
Bits reversed1100011001101110at 16 bits
Rotated left by 11110110011000110at 16 bits, wrapping
Shifted left by 11110110011000110= 60,614, no wrap
Shifted right by 111101100110001= 15,153, discarding the low bit
These bits as a double1.49736475 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime30,313+6
Previous prime30,293−14
Distance to nearest prime0, it is prime
Nearest square below30,276
Nearest square above30,625

Powers & multiples

30,307 to the power 2918,514,249
30,307 to the power 327,837,411,344,443
30,307 to the power 4843,668,425,616,034,001
30,307 to the power 525,569,058,975,145,142,468,307
First ten multiples30,307, 60,614, 90,921, 121,228, 151,535, 181,842, 212,149, 242,456, 272,763, 303,070
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 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 4
Divisible by 8No, remainder 3
Divisible by 9No, remainder 4
Divisible by 10No, remainder 7
Divisible by 11No, remainder 2
Divisible by 12No, remainder 7
Divisible by 100No, remainder 7

Collatz (3n + 1) trajectory

Steps to reach 185the total stopping time
Highest value reached136,3844× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps30,307 → 90,922 → 45,461 → 136,384 → 68,192 → 34,096 → 17,048 → 8,524 → 4,262 → 2,131 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage3,030,700%
30,307% as a decimal303.07
30,307% of 10030,307
30,307% of 1,000303,070
As a fraction of 10030,307/100

Read another way

As bytes29.597 KiB
As a 24-bit colour#007663

Keep nerding

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

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “30307” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.