Recognised as Number

60,329

Positive
Odd
Composite
5 digits

60,329 is an odd 5-digit integer and a composite number. It has 8 divisors and a digital root of 2.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value60,329

Digit count5

Digit sum20

Digit product0zero, because one of the digits is zero

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

Digital root2repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation23 × 43 × 61

Distinct prime factors323, 43, 61

Number of divisors8

Sum of divisors σ(n)65,472

Aliquot sum5,143sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)4,620the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 55,440

Möbius function μ(n)−13 distinct prime factors, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 23, 43, 61, 989, 1,403, 2,623, 60,3298 in total

Arithmetic

Previous number60,328

Next number60,330

Double120,658

Half30,164.5

Square3,639,588,241

Cube219,572,718,991,289

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

Cube root39.220101103≈

Negation-60,329

Reciprocal0.0000165758≈

Representations

Decimal60,329

Binary111010111010100116 bits

Octal165651

HexadecimalEBA9

Base 361AJT

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

In wordssixty thousand, three hundred and twenty-nine

Ordinalsixty thousand, three hundred and twenty-ninth

Scientific notation6.0329 × 10^4

Engineering notation60.329 × 10^3

In other bases

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

Quinary3412304base 5; one hand: 7 digits

Septenary340613base 7: 6 digits

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

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

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

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

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

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

Bit-level

1110101110101001

Bit length16 bitsto write the magnitude

Set bits10the population count, or Hamming weight

Zero bits6within that length

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

Highest set bitbit 15worth 32,768

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes2eb a9

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

At each machine width

16-bit1110101110101001

32-bit00000000000000001110101110101001

64-bit0000000000000000000000000000000000000000000000001110101110101001

One's complement0001010001010110at 16 bits, every bit flipped

Bits reversed1001010111010111at 16 bits

Rotated left by 11101011101010011at 16 bits, wrapping

Shifted left by 111101011101010010= 120,658, no wrap

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

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

Nearest landmarks

Next prime60,331+2

Previous prime60,317−12

Distance to nearest prime2

Nearest square below60,025

Nearest square above60,516

Powers & multiples

60,329 to the power 23,639,588,241

60,329 to the power 3219,572,718,991,289

60,329 to the power 413,246,602,564,025,474,081

60,329 to the power 5799,154,286,085,092,825,832,649

First ten multiples60,329, 120,658, 180,987, 241,316, 301,645, 361,974, 422,303, 482,632, 542,961, 603,290

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 2

Divisible by 4No, remainder 1

Divisible by 5No, remainder 4

Divisible by 6No, remainder 5

Divisible by 7No, remainder 3

Divisible by 8No, remainder 1

Divisible by 9No, remainder 2

Divisible by 10No, remainder 9

Divisible by 11No, remainder 5

Divisible by 12No, remainder 5

Divisible by 100No, remainder 29

Collatz (3n + 1) trajectory

Steps to reach 1241the total stopping time

Highest value reached1,567,34825× the starting value

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

First steps60,329 → 180,988 → 90,494 → 45,247 → 135,742 → 67,871 → 203,614 → 101,807 → 305,422 → 152,711 → …

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

As a percentage & fraction

As a percentage6,032,900%

60,329% as a decimal603.29

60,329% of 10060,329

60,329% of 1,000603,290

As a fraction of 10060,329/100

Read another way

As seconds16 hours, 45 minutes and 29 seconds

As bytes58.915 KiB

As a 24-bit colour#00EBA9

Keep nerding

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