Nerdulator> put something in

Recognised as Number

61,248

  • Positive
  • Even
  • Composite
  • 5 digits

61,248 is an even 5-digit integer and a composite number. It has 56 divisors and a digital root of 3.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value61,248
Digit count5
Digit sum21
Digit product384
Multiplicative persistence5times 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^6 × 3 × 11 × 29
Distinct prime factors42, 3, 11, 29
Number of divisors56
Sum of divisors σ(n)182,880
Aliquot sum121,632sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)17,920integers below n that share no factor with it
Carmichael function λ(n)560the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 17,920
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 4, 6, 8, 11, 12, 16, 22, 24, 29, 32, 33, 44, 48, 58, 64, 66, 87, 88, 96, 116, 132, 174, 176, 192, 232, 264, 319, 348, 352, 464, 528, 638, 696, 704, 928, 957, 1,056, 1,276, 1,392, 1,856, 1,914, 2,112, 2,552, 2,784, 3,828, 5,104, 5,568, 7,656, 10,208, 15,312, 20,416, 30,624, 61,24856 in total

Arithmetic

Previous number61,247
Next number61,249
Double122,496
Half30,624
Square root247.483332772≈irrational, shown to 9 decimal places
Cube root39.418246764≈
Negation-61,248
Reciprocal0.0000163271≈

Representations

Decimal61,248
Binary111011110100000016 bits
Octal167500
HexadecimalEF40
Base 361B9C
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssixty-one thousand, two hundred and forty-eight
Ordinalsixty-one thousand, two hundred and forty-eighth
Scientific notation6.1248 × 10^4
Engineering notation61.248 × 10^3

In other bases

Ternary10010000110base 3; the most digit-efficient integer base after e: 11 digits
Quinary3424443base 5; one hand: 7 digits
Septenary343365base 7: 6 digits
Nonary103013base 9; each digit is two ternary digits: 6 digits
Duodecimal2b540base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal7d28base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal17:0:48base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary10010000110digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10011001101000000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1110111101000000
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 even
Highest set bitbit 15worth 32,768
Lowest set bitbit 66 trailing zeros
Power of twoNo
Bytes2ef 40
Gray code1001100011100000n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1110111101000000
32-bit00000000000000001110111101000000
64-bit0000000000000000000000000000000000000000000000001110111101000000
One's complement0001000010111111at 16 bits, every bit flipped
Bits reversed0000001011110111at 16 bits
Rotated left by 11101111010000001at 16 bits, wrapping
Shifted left by 111101111010000000= 122,496, no wrap
Shifted right by 1111011110100000= 30,624, discarding the low bit
These bits as a double3.02605327 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime61,253+5
Previous prime61,231−17
Distance to nearest prime5
Nearest square below61,009
Nearest square above61,504

Powers & multiples

61,248 to the power 23,751,317,504
61,248 to the power 3229,760,694,484,992
61,248 to the power 414,072,383,015,816,790,016
61,248 to the power 5861,905,314,952,746,754,899,968
First ten multiples61,248, 122,496, 183,744, 244,992, 306,240, 367,488, 428,736, 489,984, 551,232, 612,480
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

Divisible by 2Yes
Divisible by 3Yes
Divisible by 4Yes
Divisible by 5No, remainder 3
Divisible by 6Yes
Divisible by 7No, remainder 5
Divisible by 8Yes
Divisible by 9No, remainder 3
Divisible by 10No, remainder 8
Divisible by 11Yes
Divisible by 12Yes
Divisible by 100No, remainder 48

Collatz (3n + 1) trajectory

Steps to reach 160the total stopping time
Highest value reached61,248
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps61,248 → 30,624 → 15,312 → 7,656 → 3,828 → 1,914 → 957 → 2,872 → 1,436 → 718 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage6,124,800%
61,248% as a decimal612.48
61,248% of 10061,248
61,248% of 1,000612,480
As a fraction of 10061,248/100

Read another way

As bytes59.813 KiB
As a 24-bit colour#00EF40

Keep nerding

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

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “61248” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.