Recognised as Number

60,328

Positive
Even
Composite
5 digits

60,328 is an even 5-digit integer and a composite number. It has 8 divisors and a digital root of 1.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value60,328

Digit count5

Digit sum19

Digit product0zero, because one of the digits is zero

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

Digital root1repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^3 × 7,541

Distinct prime factors22, 7,541

Number of divisors8

Sum of divisors σ(n)113,130

Aliquot sum52,802sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)7,540the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 30,160

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 2, 4, 8, 7,541, 15,082, 30,164, 60,3288 in total

Arithmetic

Previous number60,327

Next number60,329

Double120,656

Half30,164

Square3,639,467,584

Cube219,561,800,407,552

Square root245.617588947≈irrational, shown to 9 decimal places

Cube root39.2198844≈

Negation-60,328

Reciprocal0.0000165761≈

Representations

Decimal60,328

Binary111010111010100016 bits

Octal165650

HexadecimalEBA8

Base 361AJS

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

In wordssixty thousand, three hundred and twenty-eight

Ordinalsixty thousand, three hundred and twenty-eighth

Scientific notation6.0328 × 10^4

Engineering notation60.328 × 10^3

In other bases

Ternary10001202101base 3; the most digit-efficient integer base after e: 11 digits

Quinary3412303base 5; one hand: 7 digits

Septenary340612base 7: 6 digits

Nonary101671base 9; each digit is two ternary digits: 6 digits

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

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

Sexagesimal16:45:28base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

1110101110101000

Bit length16 bitsto write the magnitude

Set bits9the population count, or Hamming weight

Zero bits7within that length

Bit parityodd9 set bits, so odd; not the same as the number itself being even

Highest set bitbit 15worth 32,768

Lowest set bitbit 33 trailing zeros

Power of twoNo

Bytes2eb a8

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

At each machine width

16-bit1110101110101000

32-bit00000000000000001110101110101000

64-bit0000000000000000000000000000000000000000000000001110101110101000

One's complement0001010001010111at 16 bits, every bit flipped

Bits reversed0001010111010111at 16 bits

Rotated left by 11101011101010001at 16 bits, wrapping

Shifted left by 111101011101010000= 120,656, no wrap

Shifted right by 1111010111010100= 30,164, discarding the low bit

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

Nearest landmarks

Next prime60,331+3

Previous prime60,317−11

Distance to nearest prime3

Nearest square below60,025

Nearest square above60,516

Powers & multiples

60,328 to the power 23,639,467,584

60,328 to the power 3219,561,800,407,552

60,328 to the power 413,245,724,294,986,797,056

60,328 to the power 5799,088,055,267,963,492,794,368

First ten multiples60,328, 120,656, 180,984, 241,312, 301,640, 361,968, 422,296, 482,624, 542,952, 603,280

Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 1

Divisible by 4Yes

Divisible by 5No, remainder 3

Divisible by 6No, remainder 4

Divisible by 7No, remainder 2

Divisible by 8Yes

Divisible by 9No, remainder 1

Divisible by 10No, remainder 8

Divisible by 11No, remainder 4

Divisible by 12No, remainder 4

Divisible by 100No, remainder 28

Collatz (3n + 1) trajectory

Steps to reach 1135the total stopping time

Highest value reached60,328

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

First steps60,328 → 30,164 → 15,082 → 7,541 → 22,624 → 11,312 → 5,656 → 2,828 → 1,414 → 707 → …

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

As a percentage & fraction

As a percentage6,032,800%

60,328% as a decimal603.28

60,328% of 10060,328

60,328% of 1,000603,280

As a fraction of 10060,328/100

Read another way

As seconds16 hours, 45 minutes and 28 seconds

As bytes58.914 KiB

As a 24-bit colour#00EBA8

Keep nerding

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