Nerdulator> put something in

Recognised as Number

37,575

  • Positive
  • Odd
  • Composite
  • 5 digits

37,575 is an odd 5-digit integer and a composite number. It has 18 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value37,575
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^2 × 167
Distinct prime factors33, 5, 167
Number of divisors18
Sum of divisors σ(n)67,704
Aliquot sum30,129sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)19,920integers below n that share no factor with it
Carmichael function λ(n)4,980the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 19,920
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 5, 9, 15, 25, 45, 75, 167, 225, 501, 835, 1,503, 2,505, 4,175, 7,515, 12,525, 37,57518 in total

Arithmetic

Previous number37,574
Next number37,576
Double75,150
Square root193.84271975≈irrational, shown to 9 decimal places
Cube root33.493947076≈
Negation-37,575
Reciprocal0.0000266134≈

Representations

Decimal37,575
Binary100100101100011116 bits
Octal111307
Hexadecimal92C7
Base 36SZR
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthirty-seven thousand, five hundred and seventy-five
Ordinalthirty-seven thousand, five hundred and seventy-fifth
Scientific notation3.7575 × 10^4
Engineering notation37.575 × 10^3

In other bases

Ternary1220112200base 3; the most digit-efficient integer base after e: 10 digits
Quinary2200300base 5; one hand: 7 digits
Septenary214356base 7: 6 digits
Nonary56480base 9; each digit is two ternary digits: 5 digits
Duodecimal198b3base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal4difbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal10:26:15base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1T0T1TT0T00digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001011111011011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1001001011000111
Bit length16 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits8within that length
Bit parityeven8 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
Bytes292 c7
Gray code1101101110100100n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1001001011000111
32-bit00000000000000001001001011000111
64-bit0000000000000000000000000000000000000000000000001001001011000111
One's complement0110110100111000at 16 bits, every bit flipped
Bits reversed1110001101001001at 16 bits
Rotated left by 10010010110001111at 16 bits, wrapping
Shifted left by 110010010110001110= 75,150, no wrap
Shifted right by 1100100101100011= 18,787, discarding the low bit
These bits as a double1.85645166 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime37,579+4
Previous prime37,573−2
Distance to nearest prime2
Nearest square below37,249
Nearest square above37,636

Powers & multiples

37,575 to the power 21,411,880,625
37,575 to the power 353,051,414,484,375
37,575 to the power 41,993,406,899,250,390,625
37,575 to the power 574,902,264,239,333,427,734,375
First ten multiples37,575, 75,150, 112,725, 150,300, 187,875, 225,450, 263,025, 300,600, 338,175, 375,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 6
Divisible by 8No, remainder 7
Divisible by 9Yes
Divisible by 10No, remainder 5
Divisible by 11No, remainder 10
Divisible by 12No, remainder 3
Divisible by 100No, remainder 75

Collatz (3n + 1) trajectory

Steps to reach 162the total stopping time
Highest value reached253,6366× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps37,575 → 112,726 → 56,363 → 169,090 → 84,545 → 253,636 → 126,818 → 63,409 → 190,228 → 95,114 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage3,757,500%
37,575% as a decimal375.75
37,575% of 10037,575
37,575% of 1,000375,750
As a fraction of 10037,575/100

Read another way

As bytes36.694 KiB
As a 24-bit colour#0092C7

Keep nerding

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

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “37575” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.