Nerdulator> put something in

Recognised as Number

96,025

  • Positive
  • Odd
  • Composite
  • 5 digits

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

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value96,025
Digit count5
Digit sum22
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 factorisation5^2 × 23 × 167
Distinct prime factors35, 23, 167
Number of divisors12
Sum of divisors σ(n)124,992
Aliquot sum28,967sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)73,040integers below n that share no factor with it
Carmichael function λ(n)18,260the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 73,040
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 5, 23, 25, 115, 167, 575, 835, 3,841, 4,175, 19,205, 96,02512 in total

Arithmetic

Previous number96,024
Next number96,026
Double192,050
Square root309.879008647≈irrational, shown to 9 decimal places
Cube root45.792544059≈
Negation-96,025
Reciprocal0.000010414≈

Representations

Decimal96,025
Binary1011101110001100117 bits
Octal273431
Hexadecimal17719
Base 36223D
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsninety-six thousand and twenty-five
Ordinalninety-six thousand and twenty-fifth
Scientific notation9.6025 × 10^4
Engineering notation96.025 × 10^3

In other bases

Ternary11212201111base 3; the most digit-efficient integer base after e: 11 digits
Quinary11033100base 5; one hand: 8 digits
Septenary546646base 7: 6 digits
Nonary155644base 9; each digit is two ternary digits: 6 digits
Duodecimal476a1base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalc015base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal26:40:25base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1TT0T0T01111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101000101101101001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000000010111011100011001
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 odd
Highest set bitbit 16worth 65,536
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes301 77 19
Gray code11100110010010101n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000000010111011100011001
64-bit0000000000000000000000000000000000000000000000010111011100011001
One's complement11111111111111101000100011100110at 32 bits, every bit flipped
Bits reversed10011000111011101000000000000000at 32 bits
Rotated left by 100000000000000101110111000110010at 32 bits, wrapping
Shifted left by 1101110111000110010= 192,050, no wrap
Shifted right by 11011101110001100= 48,012, discarding the low bit
These bits as a double4.74426536 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime96,043+18
Previous prime96,017−8
Distance to nearest prime8
Nearest square below95,481
Nearest square above96,100

Powers & multiples

96,025 to the power 29,220,800,625
96,025 to the power 3885,427,380,015,625
96,025 to the power 485,023,164,166,000,390,625
96,025 to the power 58,164,349,339,040,187,509,765,625
First ten multiples96,025, 192,050, 288,075, 384,100, 480,125, 576,150, 672,175, 768,200, 864,225, 960,250
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 5Yes
Divisible by 6No, remainder 1
Divisible by 7No, remainder 6
Divisible by 8No, remainder 1
Divisible by 9No, remainder 4
Divisible by 10No, remainder 5
Divisible by 11No, remainder 6
Divisible by 12No, remainder 1
Divisible by 100No, remainder 25

Collatz (3n + 1) trajectory

Steps to reach 1182the total stopping time
Highest value reached1,052,51210× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps96,025 → 288,076 → 144,038 → 72,019 → 216,058 → 108,029 → 324,088 → 162,044 → 81,022 → 40,511 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage9,602,500%
96,025% as a decimal960.25
96,025% of 10096,025
96,025% of 1,000960,250
As a fraction of 10096,025/100

Read another way

As bytes93.774 KiB
As a 24-bit colour#017719

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