Recognised as Number
61,875
- Positive
- Odd
- Composite
- 5 digits
61,875 is an odd 5-digit integer and a composite number. It has 30 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value61,875
Digit count5
Digit sum27
Digit product1,680
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3^2 × 5^4 × 11
Distinct prime factors33, 5, 11
Number of divisors30
Sum of divisors σ(n)121,836
Aliquot sum59,961sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)30,000integers below n that share no factor with it
Carmichael function λ(n)1,500the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 30,000
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 5, 9, 11, 15, 25, 33, 45, 55, 75, 99, 125, 165, 225, 275, 375, 495, 625, 825, 1,125, 1,375, 1,875, 2,475, 4,125, 5,625, 6,875, 12,375, 20,625, 61,87530 in total
Arithmetic
Representations
Decimal61,875
Binary111100011011001116 bits
Octal170663
HexadecimalF1B3
Base 361BQR
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssixty-one thousand, eight hundred and seventy-five
Ordinalsixty-one thousand, eight hundred and seventy-fifth
Scientific notation6.1875 × 10^4
Engineering notation61.875 × 10^3
In other bases
Ternary10010212200base 3; the most digit-efficient integer base after e: 11 digits
Quinary3440000base 5; one hand: 7 digits
Septenary345252base 7: 6 digits
Nonary103780base 9; each digit is two ternary digits: 6 digits
Duodecimal2b983base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal7edfbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal17:11:15base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary100110T0T00digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10011011011110111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111000110110011
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 odd
Highest set bitbit 15worth 32,768
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes2f1 b3
Gray code1000100101101010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1111000110110011
32-bit00000000000000001111000110110011
64-bit0000000000000000000000000000000000000000000000001111000110110011
One's complement0000111001001100at 16 bits, every bit flipped
Bits reversed1100110110001111at 16 bits
Rotated left by 11110001101100111at 16 bits, wrapping
Shifted left by 111110001101100110= 123,750, no wrap
Shifted right by 1111100011011001= 30,937, discarding the low bit
These bits as a double3.05703118 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
61,875 to the power 23,828,515,625
61,875 to the power 3236,889,404,296,875
61,875 to the power 414,657,531,890,869,140,625
61,875 to the power 5906,934,785,747,528,076,171,875
First ten multiples61,875, 123,750, 185,625, 247,500, 309,375, 371,250, 433,125, 495,000, 556,875, 618,750
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5Yes
Divisible by 6No, remainder 3
Divisible by 7No, remainder 2
Divisible by 8No, remainder 3
Divisible by 9Yes
Divisible by 10No, remainder 5
Divisible by 11Yes
Divisible by 12No, remainder 3
Divisible by 100No, remainder 75
Collatz (3n + 1) trajectory
Steps to reach 186the total stopping time
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps61,875 → 185,626 → 92,813 → 278,440 → 139,220 → 69,610 → 34,805 → 104,416 → 52,208 → 26,104 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage6,187,500%
61,875% as a decimal618.75
61,875% of 10061,875
61,875% of 1,000618,750
As a fraction of 10061,875/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 61,875
Nerdulate something else
Nothing in mind? Surprise me · today’s page