Recognised as Number

60,366

Positive
Even
Composite
5 digits

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

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value60,366

Digit count5

Digit sum21

Digit product0zero, because one of the digits is zero

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

Digital root3repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 3 × 10,061

Distinct prime factors32, 3, 10,061

Number of divisors8

Sum of divisors σ(n)120,744

Aliquot sum60,378sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

Carmichael function λ(n)10,060the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 20,120

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

SquarefreeYesno repeated prime factor

All divisors1, 2, 3, 6, 10,061, 20,122, 30,183, 60,3668 in total

Arithmetic

Previous number60,365

Next number60,367

Double120,732

Half30,183

Square3,644,053,956

Cube219,976,961,107,896

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

Cube root39.228117409≈

Negation-60,366

Reciprocal0.0000165656≈

Representations

Decimal60,366

Binary111010111100111016 bits

Octal165716

HexadecimalEBCE

Base 361AKU

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

In wordssixty thousand, three hundred and sixty-six

Ordinalsixty thousand, three hundred and sixty-sixth

Scientific notation6.0366 × 10^4

Engineering notation60.366 × 10^3

In other bases

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

Quinary3412431base 5; one hand: 7 digits

Septenary340665base 7: 6 digits

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

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

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

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

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

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

Bit-level

1110101111001110

Bit length16 bitsto write the magnitude

Set bits11the population count, or Hamming weight

Zero bits5within that length

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

Highest set bitbit 15worth 32,768

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes2eb ce

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

At each machine width

16-bit1110101111001110

32-bit00000000000000001110101111001110

64-bit0000000000000000000000000000000000000000000000001110101111001110

One's complement0001010000110001at 16 bits, every bit flipped

Bits reversed0111001111010111at 16 bits

Rotated left by 11101011110011101at 16 bits, wrapping

Shifted left by 111101011110011100= 120,732, no wrap

Shifted right by 1111010111100111= 30,183, discarding the low bit

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

Nearest landmarks

Next prime60,373+7

Previous prime60,353−13

Distance to nearest prime7

Nearest square below60,025

Nearest square above60,516

Powers & multiples

60,366 to the power 23,644,053,956

60,366 to the power 3219,976,961,107,896

60,366 to the power 413,279,129,234,239,249,936

60,366 to the power 5801,607,915,354,086,561,636,576

First ten multiples60,366, 120,732, 181,098, 241,464, 301,830, 362,196, 422,562, 482,928, 543,294, 603,660

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

Divisibility tests

Divisible by 2Yes

Divisible by 3Yes

Divisible by 4No, remainder 2

Divisible by 5No, remainder 1

Divisible by 6Yes

Divisible by 7No, remainder 5

Divisible by 8No, remainder 6

Divisible by 9No, remainder 3

Divisible by 10No, remainder 6

Divisible by 11No, remainder 9

Divisible by 12No, remainder 6

Divisible by 100No, remainder 66

Collatz (3n + 1) trajectory

Steps to reach 1104the total stopping time

Highest value reached343,8165× the starting value

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

First steps60,366 → 30,183 → 90,550 → 45,275 → 135,826 → 67,913 → 203,740 → 101,870 → 50,935 → 152,806 → …

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

As a percentage & fraction

As a percentage6,036,600%

60,366% as a decimal603.66

60,366% of 10060,366

60,366% of 1,000603,660

As a fraction of 10060,366/100

Read another way

As seconds16 hours, 46 minutes and 6 seconds

As bytes58.951 KiB

As a 24-bit colour#00EBCE

Keep nerding

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