Recognised as Number

60,425

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value60,425

Digit count5

Digit sum17

Digit product0zero, because one of the digits is zero

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

Digital root8repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation5^2 × 2,417

Distinct prime factors25, 2,417

Number of divisors6

Sum of divisors σ(n)74,958

Aliquot sum14,533sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)12,080the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 48,320

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

SquarefreeNohas a repeated prime factor

All divisors1, 5, 25, 2,417, 12,085, 60,4256 in total

Arithmetic

Previous number60,424

Next number60,426

Double120,850

Half30,212.5

Square3,651,180,625

Cube220,622,589,265,625

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

Cube root39.240893394≈

Negation-60,425

Reciprocal0.0000165494≈

Representations

Decimal60,425

Binary111011000000100116 bits

Octal166011

HexadecimalEC09

Base 361AMH

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

In wordssixty thousand, four hundred and twenty-five

Ordinalsixty thousand, four hundred and twenty-fifth

Scientific notation6.0425 × 10^4

Engineering notation60.425 × 10^3

In other bases

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

Quinary3413200base 5; one hand: 7 digits

Septenary341111base 7: 6 digits

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

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

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

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

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

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

Bit-level

1110110000001001

Bit length16 bitsto write the magnitude

Set bits7the population count, or Hamming weight

Zero bits9within that length

Bit parityodd7 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

Bytes2ec 09

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

At each machine width

16-bit1110110000001001

32-bit00000000000000001110110000001001

64-bit0000000000000000000000000000000000000000000000001110110000001001

One's complement0001001111110110at 16 bits, every bit flipped

Bits reversed1001000000110111at 16 bits

Rotated left by 11101100000010011at 16 bits, wrapping

Shifted left by 111101100000010010= 120,850, no wrap

Shifted right by 1111011000000100= 30,212, discarding the low bit

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

Nearest landmarks

Next prime60,427+2

Previous prime60,413−12

Distance to nearest prime2

Nearest square below60,025

Nearest square above60,516

Powers & multiples

60,425 to the power 23,651,180,625

60,425 to the power 3220,622,589,265,625

60,425 to the power 413,331,119,956,375,390,625

60,425 to the power 5805,532,923,363,982,978,515,625

First ten multiples60,425, 120,850, 181,275, 241,700, 302,125, 362,550, 422,975, 483,400, 543,825, 604,250

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

Divisible by 6No, remainder 5

Divisible by 7No, remainder 1

Divisible by 8No, remainder 1

Divisible by 9No, remainder 8

Divisible by 10No, remainder 5

Divisible by 11No, remainder 2

Divisible by 12No, remainder 5

Divisible by 100No, remainder 25

Collatz (3n + 1) trajectory

Steps to reach 191the total stopping time

Highest value reached305,9085× the starting value

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

First steps60,425 → 181,276 → 90,638 → 45,319 → 135,958 → 67,979 → 203,938 → 101,969 → 305,908 → 152,954 → …

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

As a percentage & fraction

As a percentage6,042,500%

60,425% as a decimal604.25

60,425% of 10060,425

60,425% of 1,000604,250

As a fraction of 10060,425/100

Read another way

As seconds16 hours, 47 minutes and 5 seconds

As bytes59.009 KiB

As a 24-bit colour#00EC09

Keep nerding

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