Recognised as Number
98,462
- Positive
- Even
- Composite
- 5 digits
98,462 is an even 5-digit integer and a composite number. It has 16 divisors and a digital root of 2.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value98,462
Digit count5
Digit sum29
Digit product3,456
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 7 × 13 × 541
Distinct prime factors42, 7, 13, 541
Number of divisors16
Sum of divisors σ(n)182,112
Aliquot sum83,650sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)38,880integers below n that share no factor with it
Carmichael function λ(n)540the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 38,880
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 7, 13, 14, 26, 91, 182, 541, 1,082, 3,787, 7,033, 7,574, 14,066, 49,231, 98,46216 in total
Arithmetic
Representations
Decimal98,462
Binary1100000001001111017 bits
Octal300236
Hexadecimal1809E
Base 3623Z2
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsninety-eight thousand, four hundred and sixty-two
Ordinalninety-eight thousand, four hundred and sixty-second
Scientific notation9.8462 × 10^4
Engineering notation98.462 × 10^3
In other bases
Ternary12000001202base 3; the most digit-efficient integer base after e: 11 digits
Quinary11122322base 5; one hand: 8 digits
Septenary560030base 7: 6 digits
Nonary160052base 9; each digit is two ternary digits: 6 digits
Duodecimal48b92base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalc632base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal27:21:2base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1TT00001TT1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101000000111100010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000011000000010011110
Bit length17 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits10within that length
Bit parityodd7 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 80 9e
Gray code10100000011010001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000011000000010011110
64-bit0000000000000000000000000000000000000000000000011000000010011110
One's complement11111111111111100111111101100001at 32 bits, every bit flipped
Bits reversed01111001000000011000000000000000at 32 bits
Rotated left by 100000000000000110000000100111100at 32 bits, wrapping
Shifted left by 1110000000100111100= 196,924, no wrap
Shifted right by 11100000001001111= 49,231, discarding the low bit
These bits as a double4.86466916 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
98,462 to the power 29,694,765,444
98,462 to the power 3954,565,995,147,128
98,462 to the power 493,988,477,014,176,517,136
98,462 to the power 59,254,293,423,769,848,230,244,832
First ten multiples98,462, 196,924, 295,386, 393,848, 492,310, 590,772, 689,234, 787,696, 886,158, 984,620
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4No, remainder 2
Divisible by 5No, remainder 2
Divisible by 6No, remainder 2
Divisible by 7Yes
Divisible by 8No, remainder 6
Divisible by 9No, remainder 2
Divisible by 10No, remainder 2
Divisible by 11No, remainder 1
Divisible by 12No, remainder 2
Divisible by 100No, remainder 62
Collatz (3n + 1) trajectory
Steps to reach 197the total stopping time
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps98,462 → 49,231 → 147,694 → 73,847 → 221,542 → 110,771 → 332,314 → 166,157 → 498,472 → 249,236 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage9,846,200%
98,462% as a decimal984.62
98,462% of 10098,462
98,462% of 1,000984,620
As a fraction of 10098,462/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 98,462
Nerdulate something else
Nothing in mind? Surprise me · today’s page