Recognised as Number
89,700
- Positive
- Even
- Composite
- 5 digits
89,700 is an even 5-digit integer and a composite number. It has 72 divisors and a digital root of 6.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value89,700
Digit count5
Digit sum24
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^2 × 3 × 5^2 × 13 × 23
Distinct prime factors52, 3, 5, 13, 23
Number of divisors72
Sum of divisors σ(n)291,648
Aliquot sum201,948sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)21,120integers below n that share no factor with it
Carmichael function λ(n)660the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 21,120
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 4, 5, 6, 10, 12, 13, 15, 20, 23, 25, 26, 30, 39, 46, 50, 52, 60, 65, 69, 75, 78, 92, 100, 115, 130, 138, 150, 156, 195, 230, 260, 276, 299, 300, 325, 345, 390, 460, 575, 598, 650, 690, 780, 897, 975, 1,150, 1,196, 1,300, 1,380, 1,495, 1,725, 1,794, 1,950, 2,300, 2,990, 3,450, 3,588, 3,900, 4,485, 5,980, 6,900, 7,475, 8,970, 14,950, 17,940, 22,425, 29,900, 44,850, 89,70072 in total
Arithmetic
Representations
Decimal89,700
Binary1010111100110010017 bits
Octal257144
Hexadecimal15E64
Base 361X7O
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordseighty-nine thousand, seven hundred
Ordinaleighty-nine thousand, seven hundredth
Scientific notation8.97 × 10^4
Engineering notation89.7 × 10^3
In other bases
Ternary11120001020base 3; the most digit-efficient integer base after e: 11 digits
Quinary10332300base 5; one hand: 8 digits
Septenary522342base 7: 6 digits
Nonary146036base 9; each digit is two ternary digits: 6 digits
Duodecimal43ab0base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalb450base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal24:55:0base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1TTTT00011T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101010001110100100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010101111001100100
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 22 trailing zeros
Power of twoNo
Bytes301 5e 64
Gray code11111000101010110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010101111001100100
64-bit0000000000000000000000000000000000000000000000010101111001100100
One's complement11111111111111101010000110011011at 32 bits, every bit flipped
Bits reversed00100110011110101000000000000000at 32 bits
Rotated left by 100000000000000101011110011001000at 32 bits, wrapping
Shifted left by 1101011110011001000= 179,400, no wrap
Shifted right by 11010111100110010= 44,850, discarding the low bit
These bits as a double4.43176884 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
89,700 to the power 28,046,090,000
89,700 to the power 3721,734,273,000,000
89,700 to the power 464,739,564,288,100,000,000
89,700 to the power 55,807,138,916,642,570,000,000,000
First ten multiples89,700, 179,400, 269,100, 358,800, 448,500, 538,200, 627,900, 717,600, 807,300, 897,000
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4Yes
Divisible by 5Yes
Divisible by 6Yes
Divisible by 7No, remainder 2
Divisible by 8No, remainder 4
Divisible by 9No, remainder 6
Divisible by 10Yes
Divisible by 11No, remainder 6
Divisible by 12Yes
Divisible by 100Yes
Collatz (3n + 1) trajectory
Steps to reach 171the total stopping time
Highest value reached89,700
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps89,700 → 44,850 → 22,425 → 67,276 → 33,638 → 16,819 → 50,458 → 25,229 → 75,688 → 37,844 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage8,970,000%
89,700% as a decimal897
89,700% of 10089,700
89,700% of 1,000897,000
As a fraction of 10089,700/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 89,700
Nerdulate something else
Nothing in mind? Surprise me · today’s page