Recognised as Number
37,755
- Positive
- Odd
- Composite
- 5 digits
37,755 is an odd 5-digit integer and a composite number. It has 12 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value37,755
Digit count5
Digit sum27
Digit product3,675
Multiplicative persistence3times 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 × 839
Distinct prime factors33, 5, 839
Number of divisors12
Sum of divisors σ(n)65,520
Aliquot sum27,765sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)20,112integers below n that share no factor with it
Carmichael function λ(n)5,028the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 20,112
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 5, 9, 15, 45, 839, 2,517, 4,195, 7,551, 12,585, 37,75512 in total
Arithmetic
Representations
Decimal37,755
Binary100100110111101116 bits
Octal111573
Hexadecimal937B
Base 36T4R
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthirty-seven thousand, seven hundred and fifty-five
Ordinalthirty-seven thousand, seven hundred and fifty-fifth
Scientific notation3.7755 × 10^4
Engineering notation37.755 × 10^3
In other bases
Ternary1220210100base 3; the most digit-efficient integer base after e: 10 digits
Quinary2202010base 5; one hand: 7 digits
Septenary215034base 7: 6 digits
Nonary56710base 9; each digit is two ternary digits: 5 digits
Duodecimal19a23base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal4e7fbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal10:29:15base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1T0T1T10100digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001010010001111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1001001101111011
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
Bytes293 7b
Gray code1101101011000110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1001001101111011
32-bit00000000000000001001001101111011
64-bit0000000000000000000000000000000000000000000000001001001101111011
One's complement0110110010000100at 16 bits, every bit flipped
Bits reversed1101111011001001at 16 bits
Rotated left by 10010011011110111at 16 bits, wrapping
Shifted left by 110010011011110110= 75,510, no wrap
Shifted right by 1100100110111101= 18,877, discarding the low bit
These bits as a double1.86534485 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
37,755 to the power 21,425,440,025
37,755 to the power 353,817,488,143,875
37,755 to the power 42,031,879,264,872,000,625
37,755 to the power 576,713,601,645,242,383,596,875
First ten multiples37,755, 75,510, 113,265, 151,020, 188,775, 226,530, 264,285, 302,040, 339,795, 377,550
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 4
Divisible by 8No, remainder 3
Divisible by 9Yes
Divisible by 10No, remainder 5
Divisible by 11No, remainder 3
Divisible by 12No, remainder 3
Divisible by 100No, remainder 55
Collatz (3n + 1) trajectory
Steps to reach 1261the total stopping time
Highest value reached4,133,428109× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps37,755 → 113,266 → 56,633 → 169,900 → 84,950 → 42,475 → 127,426 → 63,713 → 191,140 → 95,570 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage3,775,500%
37,755% as a decimal377.55
37,755% of 10037,755
37,755% of 1,000377,550
As a fraction of 10037,755/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 37,755
Nerdulate something else
Nothing in mind? Surprise me · today’s page