Nerdulator> put something in

Recognised as Number

54,273

  • Positive
  • Odd
  • Composite
  • 5 digits

54,273 is an odd 5-digit integer and a composite number. It has 8 divisors and a digital root of 3.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value54,273
Digit count5
Digit sum21
Digit product840
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 79 × 229
Distinct prime factors33, 79, 229
Number of divisors8
Sum of divisors σ(n)73,600
Aliquot sum19,327sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)35,568integers below n that share no factor with it
Carmichael function λ(n)2,964the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 35,568
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 79, 229, 237, 687, 18,091, 54,2738 in total

Arithmetic

Previous number54,272
Next number54,274
Double108,546
Square root232.965662706≈irrational, shown to 9 decimal places
Cube root37.861220466≈
Negation-54,273
Reciprocal0.0000184254≈

Representations

Decimal54,273
Binary110101000000000116 bits
Octal152001
HexadecimalD401
Base 3615VL
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfifty-four thousand, two hundred and seventy-three
Ordinalfifty-four thousand, two hundred and seventy-third
Scientific notation5.4273 × 10^4
Engineering notation54.273 × 10^3

In other bases

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

Bit-level

1101010000000001
Bit length16 bitsto write the magnitude
Set bits5the population count, or Hamming weight
Zero bits11within that length
Bit parityodd5 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 15worth 32,768
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes2d4 01
Gray code1011111000000001n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1101010000000001
32-bit00000000000000001101010000000001
64-bit0000000000000000000000000000000000000000000000001101010000000001
One's complement0010101111111110at 16 bits, every bit flipped
Bits reversed1000000000101011at 16 bits
Rotated left by 11010100000000011at 16 bits, wrapping
Shifted left by 111010100000000010= 108,546, no wrap
Shifted right by 1110101000000000= 27,136, discarding the low bit
These bits as a double2.68144248 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime54,277+4
Previous prime54,269−4
Distance to nearest prime4
Nearest square below53,824
Nearest square above54,289

Powers & multiples

54,273 to the power 22,945,558,529
54,273 to the power 3159,864,298,044,417
54,273 to the power 48,676,315,047,764,643,841
54,273 to the power 5470,889,646,587,330,515,182,593
First ten multiples54,273, 108,546, 162,819, 217,092, 271,365, 325,638, 379,911, 434,184, 488,457, 542,730
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

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 2
Divisible by 8No, remainder 1
Divisible by 9No, remainder 3
Divisible by 10No, remainder 3
Divisible by 11No, remainder 10
Divisible by 12No, remainder 9
Divisible by 100No, remainder 73

Collatz (3n + 1) trajectory

Steps to reach 139the total stopping time
Highest value reached162,8203× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps54,273 → 162,820 → 81,410 → 40,705 → 122,116 → 61,058 → 30,529 → 91,588 → 45,794 → 22,897 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage5,427,300%
54,273% as a decimal542.73
54,273% of 10054,273
54,273% of 1,000542,730
As a fraction of 10054,273/100

Read another way

As bytes53.001 KiB
As a 24-bit colour#00D401

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