Recognised as Number
37,485
- Positive
- Odd
- Composite
- 5 digits
37,485 is an odd 5-digit integer and a composite number. It has 36 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value37,485
Digit count5
Digit sum27
Digit product3,360
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 × 7^2 × 17
Distinct prime factors43, 5, 7, 17
Number of divisors36
Sum of divisors σ(n)80,028
Aliquot sum42,543sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)16,128integers below n that share no factor with it
Carmichael function λ(n)336the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 16,128
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 5, 7, 9, 15, 17, 21, 35, 45, 49, 51, 63, 85, 105, 119, 147, 153, 245, 255, 315, 357, 441, 595, 735, 765, 833, 1,071, 1,785, 2,205, 2,499, 4,165, 5,355, 7,497, 12,495, 37,48536 in total
Arithmetic
Representations
Decimal37,485
Binary100100100110110116 bits
Octal111155
Hexadecimal926D
Base 36SX9
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthirty-seven thousand, four hundred and eighty-five
Ordinalthirty-seven thousand, four hundred and eighty-fifth
Scientific notation3.7485 × 10^4
Engineering notation37.485 × 10^3
In other bases
Ternary1220102100base 3; the most digit-efficient integer base after e: 10 digits
Quinary2144420base 5; one hand: 7 digits
Septenary214200base 7: 6 digits
Nonary56370base 9; each digit is two ternary digits: 5 digits
Duodecimal19839base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal4de5base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal10:24:45base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1T0T011T100digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001011110111101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1001001001101101
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 6d
Gray code1101101101011011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1001001001101101
32-bit00000000000000001001001001101101
64-bit0000000000000000000000000000000000000000000000001001001001101101
One's complement0110110110010010at 16 bits, every bit flipped
Bits reversed1011011001001001at 16 bits
Rotated left by 10010010011011011at 16 bits, wrapping
Shifted left by 110010010011011010= 74,970, no wrap
Shifted right by 1100100100110110= 18,742, discarding the low bit
These bits as a double1.85200507 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
37,485 to the power 21,405,125,225
37,485 to the power 352,671,119,059,125
37,485 to the power 41,974,376,897,931,300,625
37,485 to the power 574,009,518,018,954,803,928,125
First ten multiples37,485, 74,970, 112,455, 149,940, 187,425, 224,910, 262,395, 299,880, 337,365, 374,850
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 1
Divisible by 5Yes
Divisible by 6No, remainder 3
Divisible by 7Yes
Divisible by 8No, remainder 5
Divisible by 9Yes
Divisible by 10No, remainder 5
Divisible by 11No, remainder 8
Divisible by 12No, remainder 9
Divisible by 100No, remainder 85
Collatz (3n + 1) trajectory
Steps to reach 1186the total stopping time
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps37,485 → 112,456 → 56,228 → 28,114 → 14,057 → 42,172 → 21,086 → 10,543 → 31,630 → 15,815 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage3,748,500%
37,485% as a decimal374.85
37,485% of 10037,485
37,485% of 1,000374,850
As a fraction of 10037,485/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,485
Nerdulate something else
Nothing in mind? Surprise me · today’s page