Recognised as Number

61,673

Positive
Odd
Prime
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value61,673

Digit count5

Digit sum23

Digit product756

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

Digital root5repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation61,673

Distinct prime factors161,673

Number of divisors2

Sum of divisors σ(n)61,674

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)61,672the 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,6732 in total

Arithmetic

Previous number61,672

Next number61,674

Double123,346

Half30,836.5

Square3,803,558,929

Cube234,576,889,828,217

Square root248.340492067≈irrational, shown to 9 decimal places

Cube root39.509211119≈

Negation-61,673

Reciprocal0.0000162146≈

Representations

Decimal61,673

Binary111100001110100116 bits

Octal170351

HexadecimalF0E9

Base 361BL5

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

In wordssixty-one thousand, six hundred and seventy-three

Ordinalsixty-one thousand, six hundred and seventy-third

Scientific notation6.1673 × 10^4

Engineering notation61.673 × 10^3

In other bases

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

Quinary3433143base 5; one hand: 7 digits

Septenary344543base 7: 6 digits

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

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

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

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

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

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

Bit-level

1111000011101001

Bit length16 bitsto write the magnitude

Set bits9the population count, or Hamming weight

Zero bits7within that length

Bit parityodd9 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 e9

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

At each machine width

16-bit1111000011101001

32-bit00000000000000001111000011101001

64-bit0000000000000000000000000000000000000000000000001111000011101001

One's complement0000111100010110at 16 bits, every bit flipped

Bits reversed1001011100001111at 16 bits

Rotated left by 11110000111010011at 16 bits, wrapping

Shifted left by 111110000111010010= 123,346, no wrap

Shifted right by 1111100001110100= 30,836, discarding the low bit

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

Nearest landmarks

Next prime61,681+8

Previous prime61,667−6

Distance to nearest prime0, it is prime

Nearest square below61,504

Nearest square above62,001

Powers & multiples

61,673 to the power 23,803,558,929

61,673 to the power 3234,576,889,828,217

61,673 to the power 414,467,060,526,375,627,041

61,673 to the power 5892,227,023,843,164,046,499,593

First ten multiples61,673, 123,346, 185,019, 246,692, 308,365, 370,038, 431,711, 493,384, 555,057, 616,730

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 5No, remainder 3

Divisible by 6No, remainder 5

Divisible by 7No, remainder 3

Divisible by 8No, remainder 1

Divisible by 9No, remainder 5

Divisible by 10No, remainder 3

Divisible by 11No, remainder 7

Divisible by 12No, remainder 5

Divisible by 100No, remainder 73

Collatz (3n + 1) trajectory

Steps to reach 1135the total stopping time

Highest value reached468,3407× the starting value

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

First steps61,673 → 185,020 → 92,510 → 46,255 → 138,766 → 69,383 → 208,150 → 104,075 → 312,226 → 156,113 → …

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

As a percentage & fraction

As a percentage6,167,300%

61,673% as a decimal616.73

61,673% of 10061,673

61,673% of 1,000616,730

As a fraction of 10061,673/100

Read another way

As seconds17 hours, 7 minutes and 53 seconds

As bytes60.228 KiB

As a 24-bit colour#00F0E9

Keep nerding

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