Recognised as Number
65,097
- Positive
- Odd
- Composite
- 5 digits
65,097 is an odd 5-digit integer and a composite number. It has 8 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value65,097
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 numberYesdivisible by its own digit sum
Factors & divisors
Prime factorisation3^3 × 2,411
Distinct prime factors23, 2,411
Number of divisors8
Sum of divisors σ(n)96,480
Aliquot sum31,383sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)43,380integers below n that share no factor with it
Carmichael function λ(n)21,690the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 43,380
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 27, 2,411, 7,233, 21,699, 65,0978 in total
Arithmetic
Representations
Decimal65,097
Binary111111100100100116 bits
Octal177111
HexadecimalFE49
Base 361E89
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssixty-five thousand and ninety-seven
Ordinalsixty-five thousand and ninety-seventh
Scientific notation6.5097 × 10^4
Engineering notation65.097 × 10^3
In other bases
Ternary10022022000base 3; the most digit-efficient integer base after e: 11 digits
Quinary4040342base 5; one hand: 7 digits
Septenary360534base 7: 6 digits
Nonary108260base 9; each digit is two ternary digits: 6 digits
Duodecimal31809base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal82ehbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal18:4:57base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1010T10T000digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10000001001011001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1111111001001001
Bit length16 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits6within that length
Bit parityeven10 set bits, so even; not the same as the number itself being odd
Highest set bitbit 15worth 32,768
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes2fe 49
Gray code1000000101101101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1111111001001001
32-bit00000000000000001111111001001001
64-bit0000000000000000000000000000000000000000000000001111111001001001
One's complement0000000110110110at 16 bits, every bit flipped
Bits reversed1001001001111111at 16 bits
Rotated left by 11111110010010011at 16 bits, wrapping
Shifted left by 111111110010010010= 130,194, no wrap
Shifted right by 1111111100100100= 32,548, discarding the low bit
These bits as a double3.21621913 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
65,097 to the power 24,237,619,409
65,097 to the power 3275,856,310,667,673
65,097 to the power 417,957,418,255,533,509,281
65,097 to the power 51,168,974,056,180,464,853,665,257
First ten multiples65,097, 130,194, 195,291, 260,388, 325,485, 390,582, 455,679, 520,776, 585,873, 650,970
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 3
Divisible by 7No, remainder 4
Divisible by 8No, remainder 1
Divisible by 9Yes
Divisible by 10No, remainder 7
Divisible by 11No, remainder 10
Divisible by 12No, remainder 9
Divisible by 100No, remainder 97
Collatz (3n + 1) trajectory
Steps to reach 1161the total stopping time
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps65,097 → 195,292 → 97,646 → 48,823 → 146,470 → 73,235 → 219,706 → 109,853 → 329,560 → 164,780 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage6,509,700%
65,097% as a decimal650.97
65,097% of 10065,097
65,097% of 1,000650,970
As a fraction of 10065,097/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 65,097
Nerdulate something else
Nothing in mind? Surprise me · today’s page