Recognised as Number
97,445
- Positive
- Odd
- Composite
- 5 digits
97,445 is an odd 5-digit integer and a composite number. It has 4 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value97,445
Digit count5
Digit sum29
Digit product5,040
Multiplicative persistence2times 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 factorisation5 × 19,489
Distinct prime factors25, 19,489
Number of divisors4
Sum of divisors σ(n)116,940
Aliquot sum19,495sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)77,952integers below n that share no factor with it
Carmichael function λ(n)19,488the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 77,952
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 5, 19,489, 97,4454 in total
Arithmetic
Representations
Decimal97,445
Binary1011111001010010117 bits
Octal276245
Hexadecimal17CA5
Base 36236T
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsninety-seven thousand, four hundred and forty-five
Ordinalninety-seven thousand, four hundred and forty-fifth
Scientific notation9.7445 × 10^4
Engineering notation97.445 × 10^3
In other bases
Ternary11221200002base 3; the most digit-efficient integer base after e: 11 digits
Quinary11104240base 5; one hand: 8 digits
Septenary554045base 7: 6 digits
Nonary157602base 9; each digit is two ternary digits: 6 digits
Duodecimal48485base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalc3c5base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal27:4:5base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1TT00TT0001Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101000110111100101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010111110010100101
Bit length17 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits7within that length
Bit parityeven10 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 7c a5
Gray code11100001011110111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010111110010100101
64-bit0000000000000000000000000000000000000000000000010111110010100101
One's complement11111111111111101000001101011010at 32 bits, every bit flipped
Bits reversed10100101001111101000000000000000at 32 bits
Rotated left by 100000000000000101111100101001010at 32 bits, wrapping
Shifted left by 1101111100101001010= 194,890, no wrap
Shifted right by 11011111001010010= 48,722, discarding the low bit
These bits as a double4.81442269 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
97,445 to the power 29,495,528,025
97,445 to the power 3925,291,728,396,125
97,445 to the power 490,165,052,473,560,400,625
97,445 to the power 58,786,133,538,286,093,238,903,125
First ten multiples97,445, 194,890, 292,335, 389,780, 487,225, 584,670, 682,115, 779,560, 877,005, 974,450
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 1
Divisible by 5Yes
Divisible by 6No, remainder 5
Divisible by 7No, remainder 5
Divisible by 8No, remainder 5
Divisible by 9No, remainder 2
Divisible by 10No, remainder 5
Divisible by 11No, remainder 7
Divisible by 12No, remainder 5
Divisible by 100No, remainder 45
Collatz (3n + 1) trajectory
Steps to reach 166the total stopping time
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps97,445 → 292,336 → 146,168 → 73,084 → 36,542 → 18,271 → 54,814 → 27,407 → 82,222 → 41,111 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage9,744,500%
97,445% as a decimal974.45
97,445% of 10097,445
97,445% of 1,000974,450
As a fraction of 10097,445/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 97,445
Nerdulate something else
Nothing in mind? Surprise me · today’s page