Recognised as Number

98,019

Positive
Odd
Composite
5 digits

98,019 is an odd 5-digit integer and a composite number. It has 6 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value98,019

Digit count5

Digit sum27

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times 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 factorisation3^2 × 10,891

Distinct prime factors23, 10,891

Number of divisors6

Sum of divisors σ(n)141,596

Aliquot sum43,577sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)65,340integers below n that share no factor with it

Carmichael function λ(n)10,890the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 65,340

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 3, 9, 10,891, 32,673, 98,0196 in total

Arithmetic

Previous number98,018

Next number98,020

Double196,038

Half49,009.5

Square9,607,724,361

Cube941,739,534,140,859

Square root313.079862016≈irrational, shown to 9 decimal places

Cube root46.107342262≈

Negation-98,019

Reciprocal0.0000102021≈

Representations

Decimal98,019

Binary1011111101110001117 bits

Octal277343

Hexadecimal17EE3

Base 3623MR

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordsninety-eight thousand and nineteen

Ordinalninety-eight thousand and nineteenth

Scientific notation9.8019 × 10^4

Engineering notation98.019 × 10^3

In other bases

Ternary11222110100base 3; the most digit-efficient integer base after e: 11 digits

Quinary11114034base 5; one hand: 8 digits

Septenary555525base 7: 6 digits

Nonary158410base 9; each digit is two ternary digits: 6 digits

Duodecimal48883base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits

Vigesimalc50jbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits

Sexagesimal27:13:39base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

Balanced ternary1TT00T110100digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary1101000001100100111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000000010111111011100011

Bit length17 bitsto write the magnitude

Set bits12the population count, or Hamming weight

Zero bits5within that length

Bit parityeven12 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 7e e3

Gray code11100000110010010n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000000010111111011100011

64-bit0000000000000000000000000000000000000000000000010111111011100011

One's complement11111111111111101000000100011100at 32 bits, every bit flipped

Bits reversed11000111011111101000000000000000at 32 bits

Rotated left by 100000000000000101111110111000110at 32 bits, wrapping

Shifted left by 1101111110111000110= 196,038, no wrap

Shifted right by 11011111101110001= 49,009, discarding the low bit

These bits as a double4.84278205 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime98,041+22

Previous prime98,017−2

Distance to nearest prime2

Nearest square below97,969

Nearest square above98,596

Powers & multiples

98,019 to the power 29,607,724,361

98,019 to the power 3941,739,534,140,859

98,019 to the power 492,308,367,396,952,858,321

98,019 to the power 59,047,973,863,881,922,219,766,099

First ten multiples98,019, 196,038, 294,057, 392,076, 490,095, 588,114, 686,133, 784,152, 882,171, 980,190

Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 3

Divisible by 5No, remainder 4

Divisible by 6No, remainder 3

Divisible by 7No, remainder 5

Divisible by 8No, remainder 3

Divisible by 9Yes

Divisible by 10No, remainder 9

Divisible by 11No, remainder 9

Divisible by 12No, remainder 3

Divisible by 100No, remainder 19

Collatz (3n + 1) trajectory

Steps to reach 166the total stopping time

Highest value reached441,0884× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps98,019 → 294,058 → 147,029 → 441,088 → 220,544 → 110,272 → 55,136 → 27,568 → 13,784 → 6,892 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage9,801,900%

98,019% as a decimal980.19

98,019% of 10098,019

98,019% of 1,000980,190

As a fraction of 10098,019/100

Read another way

As seconds1 day, 3 hours and 13 minutes

As bytes95.722 KiB

As a 24-bit colour#017EE3

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.