Recognised as Number

61,254

Positive
Even
Composite
5 digits

61,254 is an even 5-digit integer and a composite number. It has 24 divisors and a digital root of 9.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value61,254

Digit count5

Digit sum18

Digit product240

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

Digital root9repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberYesdivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 3^2 × 41 × 83

Distinct prime factors42, 3, 41, 83

Number of divisors24

Sum of divisors σ(n)137,592

Aliquot sum76,338sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

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

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 3, 6, 9, 18, 41, 82, 83, 123, 166, 246, 249, 369, 498, 738, 747, 1,494, 3,403, 6,806, 10,209, 20,418, 30,627, 61,25424 in total

Arithmetic

Previous number61,253

Next number61,255

Double122,508

Half30,627

Square3,752,052,516

Cube229,828,224,815,064

Square root247.495454504≈irrational, shown to 9 decimal places

Cube root39.41953389≈

Negation-61,254

Reciprocal0.0000163255≈

Representations

Decimal61,254

Binary111011110100011016 bits

Octal167506

HexadecimalEF46

Base 361B9I

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

In wordssixty-one thousand, two hundred and fifty-four

Ordinalsixty-one thousand, two hundred and fifty-fourth

Scientific notation6.1254 × 10^4

Engineering notation61.254 × 10^3

In other bases

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

Quinary3430004base 5; one hand: 7 digits

Septenary343404base 7: 6 digits

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

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

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

Sexagesimal17:0:54base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

1110111101000110

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 even

Highest set bitbit 15worth 32,768

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes2ef 46

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

At each machine width

16-bit1110111101000110

32-bit00000000000000001110111101000110

64-bit0000000000000000000000000000000000000000000000001110111101000110

One's complement0001000010111001at 16 bits, every bit flipped

Bits reversed0110001011110111at 16 bits

Rotated left by 11101111010001101at 16 bits, wrapping

Shifted left by 111101111010001100= 122,508, no wrap

Shifted right by 1111011110100011= 30,627, discarding the low bit

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

Nearest landmarks

Next prime61,261+7

Previous prime61,253−1

Distance to nearest prime1

Nearest square below61,009

Nearest square above61,504

Powers & multiples

61,254 to the power 23,752,052,516

61,254 to the power 3229,828,224,815,064

61,254 to the power 414,077,898,082,821,930,256

61,254 to the power 5862,327,569,165,174,515,901,024

First ten multiples61,254, 122,508, 183,762, 245,016, 306,270, 367,524, 428,778, 490,032, 551,286, 612,540

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 4

Divisible by 6Yes

Divisible by 7No, remainder 4

Divisible by 8No, remainder 6

Divisible by 9Yes

Divisible by 10No, remainder 4

Divisible by 11No, remainder 6

Divisible by 12No, remainder 6

Divisible by 100No, remainder 54

Collatz (3n + 1) trajectory

Steps to reach 186the total stopping time

Highest value reached137,8242× the starting value

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

First steps61,254 → 30,627 → 91,882 → 45,941 → 137,824 → 68,912 → 34,456 → 17,228 → 8,614 → 4,307 → …

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

As a percentage & fraction

As a percentage6,125,400%

61,254% as a decimal612.54

61,254% of 10061,254

61,254% of 1,000612,540

As a fraction of 10061,254/100

Read another way

As seconds17 hours and 54 seconds

As bytes59.818 KiB

As a 24-bit colour#00EF46

Keep nerding

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