Nerdulator> put something in

Recognised as Number

30,271

  • Positive
  • Odd
  • Prime
  • 5 digits

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

Arithmetic

Previous number30,270
Next number30,272
Double60,542
Square root173.985631591≈irrational, shown to 9 decimal places
Cube root31.165606962≈
Negation-30,271
Reciprocal0.0000330349≈

Representations

Decimal30,271
Binary11101100011111115 bits
Octal73077
Hexadecimal763F
Base 36NCV
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthirty thousand, two hundred and seventy-one
Ordinalthirty thousand, two hundred and seventy-first
Scientific notation3.0271 × 10^4
Engineering notation30.271 × 10^3

In other bases

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

Bit-level

0111011000111111
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
Bytes276 3f
Gray code100110100100000n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0111011000111111
32-bit00000000000000000111011000111111
64-bit0000000000000000000000000000000000000000000000000111011000111111
One's complement1000100111000000at 16 bits, every bit flipped
Bits reversed1111110001101110at 16 bits
Rotated left by 11110110001111110at 16 bits, wrapping
Shifted left by 11110110001111110= 60,542, no wrap
Shifted right by 111101100011111= 15,135, discarding the low bit
These bits as a double1.49558612 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime30,293+22
Previous prime30,269−2
Distance to nearest prime0, it is prime
Nearest square below29,929
Nearest square above30,276

Powers & multiples

30,271 to the power 2916,333,441
30,271 to the power 327,738,329,592,511
30,271 to the power 4839,666,975,094,900,481
30,271 to the power 525,417,559,003,097,732,460,351
First ten multiples30,271, 60,542, 90,813, 121,084, 151,355, 181,626, 211,897, 242,168, 272,439, 302,710
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 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 3
Divisible by 8No, remainder 7
Divisible by 9No, remainder 4
Divisible by 10No, remainder 1
Divisible by 11No, remainder 10
Divisible by 12No, remainder 7
Divisible by 100No, remainder 71

Collatz (3n + 1) trajectory

Steps to reach 1103the total stopping time
Highest value reached689,63222× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps30,271 → 90,814 → 45,407 → 136,222 → 68,111 → 204,334 → 102,167 → 306,502 → 153,251 → 459,754 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage3,027,100%
30,271% as a decimal302.71
30,271% of 10030,271
30,271% of 1,000302,710
As a fraction of 10030,271/100

Read another way

As bytes29.562 KiB
As a 24-bit colour#00763F

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 “30271” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.