Nerdulator> put something in

Recognised as Number

36,931

  • Positive
  • Odd
  • Prime
  • 5 digits

36,931 is an odd 5-digit integer and a prime number. It has 2 divisors and a digital root of 4.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value36,931
Digit count5
Digit sum22
Digit product486
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation36,931
Distinct prime factors136,931
Number of divisors2
Sum of divisors σ(n)36,932
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)36,930integers below n that share no factor with it
Carmichael function λ(n)36,930the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 36,9312 in total

Arithmetic

Previous number36,930
Next number36,932
Double73,862
Square root192.17439996≈irrational, shown to 9 decimal places
Cube root33.301491815≈
Negation-36,931
Reciprocal0.0000270775≈

Representations

Decimal36,931
Binary100100000100001116 bits
Octal110103
Hexadecimal9043
Base 36SHV
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthirty-six thousand, nine hundred and thirty-one
Ordinalthirty-six thousand, nine hundred and thirty-first
Scientific notation3.6931 × 10^4
Engineering notation36.931 × 10^3

In other bases

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

Bit-level

1001000001000011
Bit length16 bitsto write the magnitude
Set bits5the population count, or Hamming weight
Zero bits11within that length
Bit parityodd5 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
Bytes290 43
Gray code1101100001100010n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1001000001000011
32-bit00000000000000001001000001000011
64-bit0000000000000000000000000000000000000000000000001001000001000011
One's complement0110111110111100at 16 bits, every bit flipped
Bits reversed1100001000001001at 16 bits
Rotated left by 10010000010000111at 16 bits, wrapping
Shifted left by 110010000010000110= 73,862, no wrap
Shifted right by 1100100000100001= 18,465, discarding the low bit
These bits as a double1.82463384 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime36,943+12
Previous prime36,929−2
Distance to nearest prime0, it is prime
Nearest square below36,864
Nearest square above37,249

Powers & multiples

36,931 to the power 21,363,898,761
36,931 to the power 350,370,145,142,491
36,931 to the power 41,860,219,830,257,335,121
36,931 to the power 568,699,778,551,233,643,353,651
First ten multiples36,931, 73,862, 110,793, 147,724, 184,655, 221,586, 258,517, 295,448, 332,379, 369,310
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 6
Divisible by 8No, remainder 3
Divisible by 9No, remainder 4
Divisible by 10No, remainder 1
Divisible by 11No, remainder 4
Divisible by 12No, remainder 7
Divisible by 100No, remainder 31

Collatz (3n + 1) trajectory

Steps to reach 193the total stopping time
Highest value reached166,1924× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps36,931 → 110,794 → 55,397 → 166,192 → 83,096 → 41,548 → 20,774 → 10,387 → 31,162 → 15,581 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage3,693,100%
36,931% as a decimal369.31
36,931% of 10036,931
36,931% of 1,000369,310
As a fraction of 10036,931/100

Read another way

As bytes36.065 KiB
As a 24-bit colour#009043

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