Recognised as Number
98,350
- Positive
- Even
- Composite
- 5 digits
98,350 is an even 5-digit integer and a composite number. It has 24 divisors and a digital root of 7.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value98,350
Digit count5
Digit sum25
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberYesdivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 5^2 × 7 × 281
Distinct prime factors42, 5, 7, 281
Number of divisors24
Sum of divisors σ(n)209,808
Aliquot sum111,458sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)33,600integers below n that share no factor with it
Carmichael function λ(n)840the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 33,600
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 5, 7, 10, 14, 25, 35, 50, 70, 175, 281, 350, 562, 1,405, 1,967, 2,810, 3,934, 7,025, 9,835, 14,050, 19,670, 49,175, 98,35024 in total
Arithmetic
Representations
Decimal98,350
Binary1100000000010111017 bits
Octal300056
Hexadecimal1802E
Base 3623VY
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsninety-eight thousand, three hundred and fifty
Ordinalninety-eight thousand, three hundred and fiftieth
Scientific notation9.835 × 10^4
Engineering notation98.35 × 10^3
In other bases
Ternary11222220121base 3; the most digit-efficient integer base after e: 11 digits
Quinary11121400base 5; one hand: 8 digits
Septenary556510base 7: 6 digits
Nonary158817base 9; each digit is two ternary digits: 6 digits
Duodecimal48ababase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalc5habase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal27:19:10base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1TT0000T1TT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101000000001110010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000011000000000101110
Bit length17 bitsto write the magnitude
Set bits6the population count, or Hamming weight
Zero bits11within that length
Bit parityeven6 set bits, so even; 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 2e
Gray code10100000000111001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000011000000000101110
64-bit0000000000000000000000000000000000000000000000011000000000101110
One's complement11111111111111100111111111010001at 32 bits, every bit flipped
Bits reversed01110100000000011000000000000000at 32 bits
Rotated left by 100000000000000110000000001011100at 32 bits, wrapping
Shifted left by 1110000000001011100= 196,700, no wrap
Shifted right by 11100000000010111= 49,175, discarding the low bit
These bits as a double4.85913563 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
98,350 to the power 29,672,722,500
98,350 to the power 3951,312,257,875,000
98,350 to the power 493,561,560,562,006,250,000
98,350 to the power 59,201,779,481,273,314,687,500,000
First ten multiples98,350, 196,700, 295,050, 393,400, 491,750, 590,100, 688,450, 786,800, 885,150, 983,500
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4No, remainder 2
Divisible by 5Yes
Divisible by 6No, remainder 4
Divisible by 7Yes
Divisible by 8No, remainder 6
Divisible by 9No, remainder 7
Divisible by 10Yes
Divisible by 11No, remainder 10
Divisible by 12No, remainder 10
Divisible by 100No, remainder 50
Collatz (3n + 1) trajectory
Steps to reach 153the total stopping time
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps98,350 → 49,175 → 147,526 → 73,763 → 221,290 → 110,645 → 331,936 → 165,968 → 82,984 → 41,492 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage9,835,000%
98,350% as a decimal983.5
98,350% of 10098,350
98,350% of 1,000983,500
As a fraction of 10098,350/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,350
Nerdulate something else
Nothing in mind? Surprise me · today’s page