Recognised as Number
98,447
- Positive
- Odd
- Composite
- 5 digits
98,447 is an odd 5-digit integer and a composite number. It has 4 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value98,447
Digit count5
Digit sum32
Digit product8,064
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation17 × 5,791
Distinct prime factors217, 5,791
Number of divisors4
Sum of divisors σ(n)104,256
Aliquot sum5,809sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)92,640integers below n that share no factor with it
Carmichael function λ(n)46,320the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 92,640
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 17, 5,791, 98,4474 in total
Arithmetic
Representations
Decimal98,447
Binary1100000001000111117 bits
Octal300217
Hexadecimal1808F
Base 3623YN
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsninety-eight thousand, four hundred and forty-seven
Ordinalninety-eight thousand, four hundred and forty-seventh
Scientific notation9.8447 × 10^4
Engineering notation98.447 × 10^3
In other bases
Ternary12000001012base 3; the most digit-efficient integer base after e: 11 digits
Quinary11122242base 5; one hand: 8 digits
Septenary560006base 7: 6 digits
Nonary160035base 9; each digit is two ternary digits: 6 digits
Duodecimal48b7bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalc627base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal27:20:47base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1TT0000011TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101000000110010011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000011000000010001111
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 odd
Highest set bitbit 16worth 65,536
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes301 80 8f
Gray code10100000011001000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000011000000010001111
64-bit0000000000000000000000000000000000000000000000011000000010001111
One's complement11111111111111100111111101110000at 32 bits, every bit flipped
Bits reversed11110001000000011000000000000000at 32 bits
Rotated left by 100000000000000110000000100011110at 32 bits, wrapping
Shifted left by 1110000000100011110= 196,894, no wrap
Shifted right by 11100000001000111= 49,223, discarding the low bit
These bits as a double4.86392806 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
98,447 to the power 29,691,811,809
98,447 to the power 3954,129,797,160,623
98,447 to the power 493,931,216,141,071,852,481
98,447 to the power 59,247,246,435,440,100,661,197,007
First ten multiples98,447, 196,894, 295,341, 393,788, 492,235, 590,682, 689,129, 787,576, 886,023, 984,470
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 6
Divisible by 8No, remainder 7
Divisible by 9No, remainder 5
Divisible by 10No, remainder 7
Divisible by 11No, remainder 8
Divisible by 12No, remainder 11
Divisible by 100No, remainder 47
Collatz (3n + 1) trajectory
Steps to reach 1146the total stopping time
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps98,447 → 295,342 → 147,671 → 443,014 → 221,507 → 664,522 → 332,261 → 996,784 → 498,392 → 249,196 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage9,844,700%
98,447% as a decimal984.47
98,447% of 10098,447
98,447% of 1,000984,470
As a fraction of 10098,447/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,447
Nerdulate something else
Nothing in mind? Surprise me · today’s page