Recognised as Number

61,441

Positive
Odd
Prime
5 digits

61,441 is an odd 5-digit integer and a prime number. It has 2 divisors and a digital root of 7.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value61,441

Digit count5

Digit sum16

Digit product96

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

Digital root7repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation61,441

Distinct prime factors161,441

Number of divisors2

Sum of divisors σ(n)61,442

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)61,440the smallest exponent with aˣ ≡ 1 for every unit coprime to n

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

SquarefreeYesno repeated prime factor

All divisors1, 61,4412 in total

Arithmetic

Previous number61,440

Next number61,442

Double122,882

Half30,720.5

Square3,774,996,481

Cube231,939,558,789,121

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

Cube root39.459607269≈

Negation-61,441

Reciprocal0.0000162758≈

Representations

Decimal61,441

Binary111100000000000116 bits

Octal170001

HexadecimalF001

Base 361BEP

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

In wordssixty-one thousand, four hundred and forty-one

Ordinalsixty-one thousand, four hundred and forty-first

Scientific notation6.1441 × 10^4

Engineering notation61.441 × 10^3

In other bases

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

Quinary3431231base 5; one hand: 7 digits

Septenary344062base 7: 6 digits

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

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

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

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

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

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

Bit-level

1111000000000001

Bit length16 bitsto write the magnitude

Set bits5the population count, or Hamming weight

Zero bits11within that length

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

Bytes2f0 01

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

At each machine width

16-bit1111000000000001

32-bit00000000000000001111000000000001

64-bit0000000000000000000000000000000000000000000000001111000000000001

One's complement0000111111111110at 16 bits, every bit flipped

Bits reversed1000000000001111at 16 bits

Rotated left by 11110000000000011at 16 bits, wrapping

Shifted left by 111110000000000010= 122,882, no wrap

Shifted right by 1111100000000000= 30,720, discarding the low bit

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

Nearest landmarks

Next prime61,463+22

Previous prime61,417−24

Distance to nearest prime0, it is prime

Nearest square below61,009

Nearest square above61,504

Powers & multiples

61,441 to the power 23,774,996,481

61,441 to the power 3231,939,558,789,121

61,441 to the power 414,250,598,431,562,383,361

61,441 to the power 5875,571,018,233,624,396,083,201

First ten multiples61,441, 122,882, 184,323, 245,764, 307,205, 368,646, 430,087, 491,528, 552,969, 614,410

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 1

Divisible by 5No, remainder 1

Divisible by 6No, remainder 1

Divisible by 7No, remainder 2

Divisible by 8No, remainder 1

Divisible by 9No, remainder 7

Divisible by 10No, remainder 1

Divisible by 11No, remainder 6

Divisible by 12No, remainder 1

Divisible by 100No, remainder 41

Collatz (3n + 1) trajectory

Steps to reach 160the total stopping time

Highest value reached184,3243× the starting value

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

First steps61,441 → 184,324 → 92,162 → 46,081 → 138,244 → 69,122 → 34,561 → 103,684 → 51,842 → 25,921 → …

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

As a percentage & fraction

As a percentage6,144,100%

61,441% as a decimal614.41

61,441% of 10061,441

61,441% of 1,000614,410

As a fraction of 10061,441/100

Read another way

As seconds17 hours, 4 minutes and 1 second

As bytes60.001 KiB

As a 24-bit colour#00F001

Keep nerding

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