Recognised as Number

60,165

Positive
Odd
Composite
5 digits

60,165 is an odd 5-digit integer and a composite number. It has 24 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value60,165

Digit count5

Digit sum18

Digit product0zero, because one of the digits is zero

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

Digital root9repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3^2 × 5 × 7 × 191

Distinct prime factors43, 5, 7, 191

Number of divisors24

Sum of divisors σ(n)119,808

Aliquot sum59,643sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)1,140the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 27,360

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

SquarefreeNohas a repeated prime factor

All divisors1, 3, 5, 7, 9, 15, 21, 35, 45, 63, 105, 191, 315, 573, 955, 1,337, 1,719, 2,865, 4,011, 6,685, 8,595, 12,033, 20,055, 60,16524 in total

Arithmetic

Previous number60,164

Next number60,166

Double120,330

Half30,082.5

Square3,619,827,225

Cube217,786,904,992,125

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

Cube root39.184529853≈

Negation-60,165

Reciprocal0.000016621≈

Representations

Decimal60,165

Binary111010110000010116 bits

Octal165405

HexadecimalEB05

Base 361AF9

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

In wordssixty thousand, one hundred and sixty-five

Ordinalsixty thousand, one hundred and sixty-fifth

Scientific notation6.0165 × 10^4

Engineering notation60.165 × 10^3

In other bases

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

Quinary3411130base 5; one hand: 7 digits

Septenary340260base 7: 6 digits

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

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

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

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

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

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

Bit-level

1110101100000101

Bit length16 bitsto write the magnitude

Set bits8the population count, or Hamming weight

Zero bits8within that length

Bit parityeven8 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 05

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

At each machine width

16-bit1110101100000101

32-bit00000000000000001110101100000101

64-bit0000000000000000000000000000000000000000000000001110101100000101

One's complement0001010011111010at 16 bits, every bit flipped

Bits reversed1010000011010111at 16 bits

Rotated left by 11101011000001011at 16 bits, wrapping

Shifted left by 111101011000001010= 120,330, no wrap

Shifted right by 1111010110000010= 30,082, discarding the low bit

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

Nearest landmarks

Next prime60,167+2

Previous prime60,161−4

Distance to nearest prime2

Nearest square below60,025

Nearest square above60,516

Powers & multiples

60,165 to the power 23,619,827,225

60,165 to the power 3217,786,904,992,125

60,165 to the power 413,103,149,138,851,200,625

60,165 to the power 5788,350,967,938,982,485,603,125

First ten multiples60,165, 120,330, 180,495, 240,660, 300,825, 360,990, 421,155, 481,320, 541,485, 601,650

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 5Yes

Divisible by 6No, remainder 3

Divisible by 7Yes

Divisible by 8No, remainder 5

Divisible by 9Yes

Divisible by 10No, remainder 5

Divisible by 11No, remainder 6

Divisible by 12No, remainder 9

Divisible by 100No, remainder 65

Collatz (3n + 1) trajectory

Steps to reach 191the total stopping time

Highest value reached180,4963× the starting value

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

First steps60,165 → 180,496 → 90,248 → 45,124 → 22,562 → 11,281 → 33,844 → 16,922 → 8,461 → 25,384 → …

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

As a percentage & fraction

As a percentage6,016,500%

60,165% as a decimal601.65

60,165% of 10060,165

60,165% of 1,000601,650

As a fraction of 10060,165/100

Read another way

As seconds16 hours, 42 minutes and 45 seconds

As bytes58.755 KiB

As a 24-bit colour#00EB05

Keep nerding

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