Nerdulator> put something in

Recognised as Number

92,137

  • Positive
  • Odd
  • Composite
  • 5 digits

92,137 is an odd 5-digit integer and a composite number. It has 4 divisors and a digital root of 4.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value92,137
Digit count5
Digit sum22
Digit product378
Multiplicative persistence5times 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 factorisation199 × 463
Distinct prime factors2199, 463
Number of divisors4
Sum of divisors σ(n)92,800
Aliquot sum663sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)91,476integers below n that share no factor with it
Carmichael function λ(n)1,386the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 91,476
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 199, 463, 92,1374 in total

Arithmetic

Previous number92,136
Next number92,138
Double184,274
Square root303.540771561≈irrational, shown to 9 decimal places
Cube root45.165971465≈
Negation-92,137
Reciprocal0.0000108534≈

Representations

Decimal92,137
Binary1011001111110100117 bits
Octal263751
Hexadecimal167E9
Base 361Z3D
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsninety-two thousand, one hundred and thirty-seven
Ordinalninety-two thousand, one hundred and thirty-seventh
Scientific notation9.2137 × 10^4
Engineering notation92.137 × 10^3

In other bases

Ternary11200101111base 3; the most digit-efficient integer base after e: 11 digits
Quinary10422022base 5; one hand: 8 digits
Septenary532423base 7: 6 digits
Nonary150344base 9; each digit is two ternary digits: 6 digits
Duodecimal453a1base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalba6hbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal25:35:37base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1TTT00101111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101011100000111001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000000010110011111101001
Bit length17 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits6within that length
Bit parityodd11 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 16worth 65,536
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes301 67 e9
Gray code11101010000011101n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000000010110011111101001
64-bit0000000000000000000000000000000000000000000000010110011111101001
One's complement11111111111111101001100000010110at 32 bits, every bit flipped
Bits reversed10010111111001101000000000000000at 32 bits
Rotated left by 100000000000000101100111111010010at 32 bits, wrapping
Shifted left by 1101100111111010010= 184,274, no wrap
Shifted right by 11011001111110100= 46,068, discarding the low bit
These bits as a double4.55217264 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime92,143+6
Previous prime92,119−18
Distance to nearest prime6
Nearest square below91,809
Nearest square above92,416

Powers & multiples

92,137 to the power 28,489,226,769
92,137 to the power 3782,171,886,815,353
92,137 to the power 472,066,971,135,506,179,361
92,137 to the power 56,640,034,519,512,132,847,784,457
First ten multiples92,137, 184,274, 276,411, 368,548, 460,685, 552,822, 644,959, 737,096, 829,233, 921,370
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 1164the total stopping time
Highest value reached1,514,75216× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps92,137 → 276,412 → 138,206 → 69,103 → 207,310 → 103,655 → 310,966 → 155,483 → 466,450 → 233,225 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage9,213,700%
92,137% as a decimal921.37
92,137% of 10092,137
92,137% of 1,000921,370
As a fraction of 10092,137/100

Read another way

As bytes89.978 KiB
As a 24-bit colour#0167E9

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