Recognised as Number
97,357
- Positive
- Odd
- Composite
- 5 digits
97,357 is an odd 5-digit integer and a composite number. It has 4 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value97,357
Digit count5
Digit sum31
Digit product6,615
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation13 × 7,489
Distinct prime factors213, 7,489
Number of divisors4
Sum of divisors σ(n)104,860
Aliquot sum7,503sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)89,856integers below n that share no factor with it
Carmichael function λ(n)7,488the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 89,856
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 13, 7,489, 97,3574 in total
Arithmetic
Representations
Decimal97,357
Binary1011111000100110117 bits
Octal276115
Hexadecimal17C4D
Base 36234D
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsninety-seven thousand, three hundred and fifty-seven
Ordinalninety-seven thousand, three hundred and fifty-seventh
Scientific notation9.7357 × 10^4
Engineering notation97.357 × 10^3
In other bases
Ternary11221112211base 3; the most digit-efficient integer base after e: 11 digits
Quinary11103412base 5; one hand: 8 digits
Septenary553561base 7: 6 digits
Nonary157484base 9; each digit is two ternary digits: 6 digits
Duodecimal48411base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalc37hbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal27:2:37base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1TT00TTT0T11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101000110001011101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010111110001001101
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 4d
Gray code11100001001101011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010111110001001101
64-bit0000000000000000000000000000000000000000000000010111110001001101
One's complement11111111111111101000001110110010at 32 bits, every bit flipped
Bits reversed10110010001111101000000000000000at 32 bits
Rotated left by 100000000000000101111100010011010at 32 bits, wrapping
Shifted left by 1101111100010011010= 194,714, no wrap
Shifted right by 11011111000100110= 48,678, discarding the low bit
These bits as a double4.81007491 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
97,357 to the power 29,478,385,449
97,357 to the power 3922,787,172,158,293
97,357 to the power 489,839,790,719,814,931,601
97,357 to the power 58,746,532,505,109,022,295,878,557
First ten multiples97,357, 194,714, 292,071, 389,428, 486,785, 584,142, 681,499, 778,856, 876,213, 973,570
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 1
Divisible by 8No, remainder 5
Divisible by 9No, remainder 4
Divisible by 10No, remainder 7
Divisible by 11No, remainder 7
Divisible by 12No, remainder 1
Divisible by 100No, remainder 57
Collatz (3n + 1) trajectory
Steps to reach 1159the total stopping time
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps97,357 → 292,072 → 146,036 → 73,018 → 36,509 → 109,528 → 54,764 → 27,382 → 13,691 → 41,074 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage9,735,700%
97,357% as a decimal973.57
97,357% of 10097,357
97,357% of 1,000973,570
As a fraction of 10097,357/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,357
Nerdulate something else
Nothing in mind? Surprise me · today’s page