Recognised as Number
96,426
- Positive
- Even
- Composite
- 5 digits
96,426 is an even 5-digit integer and a composite number. It has 24 divisors and a digital root of 9.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value96,426
Digit count5
Digit sum27
Digit product2,592
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 3^2 × 11 × 487
Distinct prime factors42, 3, 11, 487
Number of divisors24
Sum of divisors σ(n)228,384
Aliquot sum131,958sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)29,160integers below n that share no factor with it
Carmichael function λ(n)2,430the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 29,160
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 6, 9, 11, 18, 22, 33, 66, 99, 198, 487, 974, 1,461, 2,922, 4,383, 5,357, 8,766, 10,714, 16,071, 32,142, 48,213, 96,42624 in total
Arithmetic
Representations
Decimal96,426
Binary1011110001010101017 bits
Octal274252
Hexadecimal178AA
Base 3622EI
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsninety-six thousand, four hundred and twenty-six
Ordinalninety-six thousand, four hundred and twenty-sixth
Scientific notation9.6426 × 10^4
Engineering notation96.426 × 10^3
In other bases
Ternary11220021100base 3; the most digit-efficient integer base after e: 11 digits
Quinary11041201base 5; one hand: 8 digits
Septenary551061base 7: 6 digits
Nonary156240base 9; each digit is two ternary digits: 6 digits
Duodecimal47976base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalc116base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal26:47:6base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1TT0T01T1100digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101000100111111110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010111100010101010
Bit length17 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits8within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being even
Highest set bitbit 16worth 65,536
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes301 78 aa
Gray code11100010011111111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010111100010101010
64-bit0000000000000000000000000000000000000000000000010111100010101010
One's complement11111111111111101000011101010101at 32 bits, every bit flipped
Bits reversed01010101000111101000000000000000at 32 bits
Rotated left by 100000000000000101111000101010100at 32 bits, wrapping
Shifted left by 1101111000101010100= 192,852, no wrap
Shifted right by 11011110001010101= 48,213, discarding the low bit
These bits as a double4.7640774 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
96,426 to the power 29,297,973,476
96,426 to the power 3896,566,390,396,776
96,426 to the power 486,452,310,760,399,522,576
96,426 to the power 58,336,250,517,382,284,363,913,376
First ten multiples96,426, 192,852, 289,278, 385,704, 482,130, 578,556, 674,982, 771,408, 867,834, 964,260
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4No, remainder 2
Divisible by 5No, remainder 1
Divisible by 6Yes
Divisible by 7No, remainder 1
Divisible by 8No, remainder 2
Divisible by 9Yes
Divisible by 10No, remainder 6
Divisible by 11Yes
Divisible by 12No, remainder 6
Divisible by 100No, remainder 26
Collatz (3n + 1) trajectory
Steps to reach 127the total stopping time
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps96,426 → 48,213 → 144,640 → 72,320 → 36,160 → 18,080 → 9,040 → 4,520 → 2,260 → 1,130 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage9,642,600%
96,426% as a decimal964.26
96,426% of 10096,426
96,426% of 1,000964,260
As a fraction of 10096,426/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 96,426
Nerdulate something else
Nothing in mind? Surprise me · today’s page