Nerdulator> put something in

Recognised as Number

30,273

  • Positive
  • Odd
  • Composite
  • 5 digits

30,273 is an odd 5-digit integer and a composite number. It has 4 divisors and a digital root of 6.

Number properties

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

Factors & divisors

Prime factorisation3 × 10,091
Distinct prime factors23, 10,091
Number of divisors4
Sum of divisors σ(n)40,368
Aliquot sum10,095sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)20,180integers below n that share no factor with it
Carmichael function λ(n)10,090the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 20,180
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 10,091, 30,2734 in total

Arithmetic

Previous number30,272
Next number30,274
Double60,546
Square root173.991379097≈irrational, shown to 9 decimal places
Cube root31.166293316≈
Negation-30,273
Reciprocal0.0000330327≈

Representations

Decimal30,273
Binary11101100100000115 bits
Octal73101
Hexadecimal7641
Base 36NCX
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthirty thousand, two hundred and seventy-three
Ordinalthirty thousand, two hundred and seventy-third
Scientific notation3.0273 × 10^4
Engineering notation30.273 × 10^3

In other bases

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

Bit-level

0111011001000001
Bit length15 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits8within that length
Bit parityodd7 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 41
Gray code100110101100001n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit0111011001000001
32-bit00000000000000000111011001000001
64-bit0000000000000000000000000000000000000000000000000111011001000001
One's complement1000100110111110at 16 bits, every bit flipped
Bits reversed1000001001101110at 16 bits
Rotated left by 11110110010000010at 16 bits, wrapping
Shifted left by 11110110010000010= 60,546, no wrap
Shifted right by 111101100100000= 15,136, discarding the low bit
These bits as a double1.49568493 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime30,293+20
Previous prime30,271−2
Distance to nearest prime2
Nearest square below29,929
Nearest square above30,276

Powers & multiples

30,273 to the power 2916,454,529
30,273 to the power 327,743,827,956,417
30,273 to the power 4839,888,903,724,611,841
30,273 to the power 525,425,956,782,455,174,262,593
First ten multiples30,273, 60,546, 90,819, 121,092, 151,365, 181,638, 211,911, 242,184, 272,457, 302,730
Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)

Divisibility tests

Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 3
Divisible by 7No, remainder 5
Divisible by 8No, remainder 1
Divisible by 9No, remainder 6
Divisible by 10No, remainder 3
Divisible by 11No, remainder 1
Divisible by 12No, remainder 9
Divisible by 100No, remainder 73

Collatz (3n + 1) trajectory

Steps to reach 146the total stopping time
Highest value reached90,8203× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps30,273 → 90,820 → 45,410 → 22,705 → 68,116 → 34,058 → 17,029 → 51,088 → 25,544 → 12,772 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage3,027,300%
30,273% as a decimal302.73
30,273% of 10030,273
30,273% of 1,000302,730
As a fraction of 10030,273/100

Read another way

As bytes29.563 KiB
As a 24-bit colour#007641

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