Nerdulator> put something in

Recognised as Number

37,835

  • Positive
  • Odd
  • Composite
  • 5 digits

37,835 is an odd 5-digit integer and a composite number. It has 16 divisors and a digital root of 8.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value37,835
Digit count5
Digit sum26
Digit product2,520
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation5 × 7 × 23 × 47
Distinct prime factors45, 7, 23, 47
Number of divisors16
Sum of divisors σ(n)55,296
Aliquot sum17,461sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)24,288integers below n that share no factor with it
Carmichael function λ(n)3,036the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 24,288
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 5, 7, 23, 35, 47, 115, 161, 235, 329, 805, 1,081, 1,645, 5,405, 7,567, 37,83516 in total

Arithmetic

Previous number37,834
Next number37,836
Double75,670
Square root194.512210414≈irrational, shown to 9 decimal places
Cube root33.571023298≈
Negation-37,835
Reciprocal0.0000264306≈

Representations

Decimal37,835
Binary100100111100101116 bits
Octal111713
Hexadecimal93CB
Base 36T6Z
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthirty-seven thousand, eight hundred and thirty-five
Ordinalthirty-seven thousand, eight hundred and thirty-fifth
Scientific notation3.7835 × 10^4
Engineering notation37.835 × 10^3

In other bases

Ternary1220220022base 3; the most digit-efficient integer base after e: 10 digits
Quinary2202320base 5; one hand: 7 digits
Septenary215210base 7: 6 digits
Nonary56808base 9; each digit is two ternary digits: 5 digits
Duodecimal19a8bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal4ebfbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal10:30:35base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1T0T10T010Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001010011011111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1001001111001011
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
Bytes293 cb
Gray code1101101000101110n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1001001111001011
32-bit00000000000000001001001111001011
64-bit0000000000000000000000000000000000000000000000001001001111001011
One's complement0110110000110100at 16 bits, every bit flipped
Bits reversed1101001111001001at 16 bits
Rotated left by 10010011110010111at 16 bits, wrapping
Shifted left by 110010011110010110= 75,670, no wrap
Shifted right by 1100100111100101= 18,917, discarding the low bit
These bits as a double1.86929737 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime37,847+12
Previous prime37,831−4
Distance to nearest prime4
Nearest square below37,636
Nearest square above38,025

Powers & multiples

37,835 to the power 21,431,487,225
37,835 to the power 354,160,319,157,875
37,835 to the power 42,049,155,675,338,200,625
37,835 to the power 577,529,804,976,420,820,646,875
First ten multiples37,835, 75,670, 113,505, 151,340, 189,175, 227,010, 264,845, 302,680, 340,515, 378,350
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 3
Divisible by 5Yes
Divisible by 6No, remainder 5
Divisible by 7Yes
Divisible by 8No, remainder 3
Divisible by 9No, remainder 8
Divisible by 10No, remainder 5
Divisible by 11No, remainder 6
Divisible by 12No, remainder 11
Divisible by 100No, remainder 35

Collatz (3n + 1) trajectory

Steps to reach 162the total stopping time
Highest value reached170,2604× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps37,835 → 113,506 → 56,753 → 170,260 → 85,130 → 42,565 → 127,696 → 63,848 → 31,924 → 15,962 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage3,783,500%
37,835% as a decimal378.35
37,835% of 10037,835
37,835% of 1,000378,350
As a fraction of 10037,835/100

Read another way

As bytes36.948 KiB
As a 24-bit colour#0093CB

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 “37835” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.