Nerdulator> put something in

Recognised as Number

97,492

  • Positive
  • Even
  • Composite
  • 5 digits

97,492 is an even 5-digit integer and a composite number. It has 6 divisors and a digital root of 4.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value97,492
Digit count5
Digit sum31
Digit product4,536
Multiplicative persistence3times 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 factorisation2^2 × 24,373
Distinct prime factors22, 24,373
Number of divisors6
Sum of divisors σ(n)170,618
Aliquot sum73,126sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)48,744integers below n that share no factor with it
Carmichael function λ(n)24,372the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 48,744
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 24,373, 48,746, 97,4926 in total

Arithmetic

Previous number97,491
Next number97,493
Double194,984
Half48,746
Square root312.237089405≈irrational, shown to 9 decimal places
Cube root46.024561552≈
Negation-97,492
Reciprocal0.0000102573≈

Representations

Decimal97,492
Binary1011111001101010017 bits
Octal276324
Hexadecimal17CD4
Base 362384
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsninety-seven thousand, four hundred and ninety-two
Ordinalninety-seven thousand, four hundred and ninety-second
Scientific notation9.7492 × 10^4
Engineering notation97.492 × 10^3

In other bases

Ternary11221201211base 3; the most digit-efficient integer base after e: 11 digits
Quinary11104432base 5; one hand: 8 digits
Septenary554143base 7: 6 digits
Nonary157654base 9; each digit is two ternary digits: 6 digits
Duodecimal48504base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalc3ecbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal27:4:52base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1TT00TT1TT11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101000110111010100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000000010111110011010100
Bit length17 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits7within that length
Bit parityeven10 set bits, so even; not the same as the number itself being even
Highest set bitbit 16worth 65,536
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes301 7c d4
Gray code11100001010111110n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000000010111110011010100
64-bit0000000000000000000000000000000000000000000000010111110011010100
One's complement11111111111111101000001100101011at 32 bits, every bit flipped
Bits reversed00101011001111101000000000000000at 32 bits
Rotated left by 100000000000000101111100110101000at 32 bits, wrapping
Shifted left by 1101111100110101000= 194,984, no wrap
Shifted right by 11011111001101010= 48,746, discarding the low bit
These bits as a double4.81674479 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime97,499+7
Previous prime97,463−29
Distance to nearest prime7
Nearest square below97,344
Nearest square above97,969

Powers & multiples

97,492 to the power 29,504,690,064
97,492 to the power 3926,631,243,719,488
97,492 to the power 490,339,133,212,700,324,096
97,492 to the power 58,807,342,775,172,579,996,767,232
First ten multiples97,492, 194,984, 292,476, 389,968, 487,460, 584,952, 682,444, 779,936, 877,428, 974,920
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 140the total stopping time
Highest value reached97,492
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps97,492 → 48,746 → 24,373 → 73,120 → 36,560 → 18,280 → 9,140 → 4,570 → 2,285 → 6,856 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage9,749,200%
97,492% as a decimal974.92
97,492% of 10097,492
97,492% of 1,000974,920
As a fraction of 10097,492/100

Read another way

As bytes95.207 KiB
As a 24-bit colour#017CD4

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