Recognised as Number

61,246

Positive
Even
Composite
5 digits

61,246 is an even 5-digit integer and a composite number. It has 8 divisors and a digital root of 1.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value61,246

Digit count5

Digit sum19

Digit product288

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

Digital root1repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 113 × 271

Distinct prime factors32, 113, 271

Number of divisors8

Sum of divisors σ(n)93,024

Aliquot sum31,778sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

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

SquarefreeYesno repeated prime factor

All divisors1, 2, 113, 226, 271, 542, 30,623, 61,2468 in total

Arithmetic

Previous number61,245

Next number61,247

Double122,492

Half30,623

Square3,751,072,516

Cube229,738,187,314,936

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

Cube root39.417817703≈

Negation-61,246

Reciprocal0.0000163276≈

Representations

Decimal61,246

Binary111011110011111016 bits

Octal167476

HexadecimalEF3E

Base 361B9A

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

In wordssixty-one thousand, two hundred and forty-six

Ordinalsixty-one thousand, two hundred and forty-sixth

Scientific notation6.1246 × 10^4

Engineering notation61.246 × 10^3

In other bases

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

Quinary3424441base 5; one hand: 7 digits

Septenary343363base 7: 6 digits

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

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

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

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

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

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

Bit-level

1110111100111110

Bit length16 bitsto write the magnitude

Set bits12the population count, or Hamming weight

Zero bits4within that length

Bit parityeven12 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 3e

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

At each machine width

16-bit1110111100111110

32-bit00000000000000001110111100111110

64-bit0000000000000000000000000000000000000000000000001110111100111110

One's complement0001000011000001at 16 bits, every bit flipped

Bits reversed0111110011110111at 16 bits

Rotated left by 11101111001111101at 16 bits, wrapping

Shifted left by 111101111001111100= 122,492, no wrap

Shifted right by 1111011110011111= 30,623, discarding the low bit

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

Nearest landmarks

Next prime61,253+7

Previous prime61,231−15

Distance to nearest prime7

Nearest square below61,009

Nearest square above61,504

Powers & multiples

61,246 to the power 23,751,072,516

61,246 to the power 3229,738,187,314,936

61,246 to the power 414,070,545,020,290,570,256

61,246 to the power 5861,764,600,312,716,265,898,976

First ten multiples61,246, 122,492, 183,738, 244,984, 306,230, 367,476, 428,722, 489,968, 551,214, 612,460

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

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 1

Divisible by 4No, remainder 2

Divisible by 5No, remainder 1

Divisible by 6No, remainder 4

Divisible by 7No, remainder 3

Divisible by 8No, remainder 6

Divisible by 9No, remainder 1

Divisible by 10No, remainder 6

Divisible by 11No, remainder 9

Divisible by 12No, remainder 10

Divisible by 100No, remainder 46

Collatz (3n + 1) trajectory

Steps to reach 1166the total stopping time

Highest value reached523,2408× the starting value

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

First steps61,246 → 30,623 → 91,870 → 45,935 → 137,806 → 68,903 → 206,710 → 103,355 → 310,066 → 155,033 → …

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

As a percentage & fraction

As a percentage6,124,600%

61,246% as a decimal612.46

61,246% of 10061,246

61,246% of 1,000612,460

As a fraction of 10061,246/100

Read another way

As seconds17 hours and 46 seconds

As bytes59.811 KiB

As a 24-bit colour#00EF3E

Keep nerding

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