Recognised as Number

60,045

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value60,045

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 numberYesdivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 5 × 4,003

Distinct prime factors33, 5, 4,003

Number of divisors8

Sum of divisors σ(n)96,096

Aliquot sum36,051sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)8,004the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 32,016

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

SquarefreeYesno repeated prime factor

All divisors1, 3, 5, 15, 4,003, 12,009, 20,015, 60,0458 in total

Arithmetic

Previous number60,044

Next number60,046

Double120,090

Half30,022.5

Square3,605,402,025

Cube216,486,364,591,125

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

Cube root39.158461135≈

Negation-60,045

Reciprocal0.0000166542≈

Representations

Decimal60,045

Binary111010101000110116 bits

Octal165215

HexadecimalEA8D

Base 361ABX

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

In wordssixty thousand and forty-five

Ordinalsixty thousand and forty-fifth

Scientific notation6.0045 × 10^4

Engineering notation60.045 × 10^3

In other bases

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

Quinary3410140base 5; one hand: 7 digits

Septenary340026base 7: 6 digits

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

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

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

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

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

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

Bit-level

1110101010001101

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 odd

Highest set bitbit 15worth 32,768

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes2ea 8d

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

At each machine width

16-bit1110101010001101

32-bit00000000000000001110101010001101

64-bit0000000000000000000000000000000000000000000000001110101010001101

One's complement0001010101110010at 16 bits, every bit flipped

Bits reversed1011000101010111at 16 bits

Rotated left by 11101010100011011at 16 bits, wrapping

Shifted left by 111101010100011010= 120,090, no wrap

Shifted right by 1111010101000110= 30,022, discarding the low bit

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

Nearest landmarks

Next prime60,077+32

Previous prime60,041−4

Distance to nearest prime4

Nearest square below60,025

Nearest square above60,516

Powers & multiples

60,045 to the power 23,605,402,025

60,045 to the power 3216,486,364,591,125

60,045 to the power 412,998,923,761,874,100,625

60,045 to the power 5780,520,377,281,730,372,028,125

First ten multiples60,045, 120,090, 180,135, 240,180, 300,225, 360,270, 420,315, 480,360, 540,405, 600,450

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 7No, remainder 6

Divisible by 8No, remainder 5

Divisible by 9No, remainder 6

Divisible by 10No, remainder 5

Divisible by 11No, remainder 7

Divisible by 12No, remainder 9

Divisible by 100No, remainder 45

Collatz (3n + 1) trajectory

Steps to reach 1179the total stopping time

Highest value reached250,5044× the starting value

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

First steps60,045 → 180,136 → 90,068 → 45,034 → 22,517 → 67,552 → 33,776 → 16,888 → 8,444 → 4,222 → …

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

As a percentage & fraction

As a percentage6,004,500%

60,045% as a decimal600.45

60,045% of 10060,045

60,045% of 1,000600,450

As a fraction of 10060,045/100

Read another way

As seconds16 hours, 40 minutes and 45 seconds

As bytes58.638 KiB

As a 24-bit colour#00EA8D

Keep nerding

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