Nerdulator> put something in

Recognised as Number

65,167

  • Positive
  • Odd
  • Prime
  • 5 digits

65,167 is an odd 5-digit integer and a prime number. It has 2 divisors and a digital root of 7.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value65,167
Digit count5
Digit sum25
Digit product1,260
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation65,167
Distinct prime factors165,167
Number of divisors2
Sum of divisors σ(n)65,168
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)65,166integers below n that share no factor with it
Carmichael function λ(n)65,166the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 65,1672 in total

Arithmetic

Previous number65,166
Next number65,168
Double130,334
Square root255.27827953≈irrational, shown to 9 decimal places
Cube root40.241662046≈
Negation-65,167
Reciprocal0.0000153452≈

Representations

Decimal65,167
Binary111111101000111116 bits
Octal177217
HexadecimalFE8F
Base 361EA7
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssixty-five thousand, one hundred and sixty-seven
Ordinalsixty-five thousand, one hundred and sixty-seventh
Scientific notation6.5167 × 10^4
Engineering notation65.167 × 10^3

In other bases

Ternary10022101121base 3; the most digit-efficient integer base after e: 11 digits
Quinary4041132base 5; one hand: 7 digits
Septenary360664base 7: 6 digits
Nonary108347base 9; each digit is two ternary digits: 6 digits
Duodecimal31867base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal82i7base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal18:6:7base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1010T11TTT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10000001110010011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1111111010001111
Bit length16 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits4within that length
Bit parityeven12 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 8f
Gray code1000000111001000n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1111111010001111
32-bit00000000000000001111111010001111
64-bit0000000000000000000000000000000000000000000000001111111010001111
One's complement0000000101110000at 16 bits, every bit flipped
Bits reversed1111000101111111at 16 bits
Rotated left by 11111110100011111at 16 bits, wrapping
Shifted left by 111111110100011110= 130,334, no wrap
Shifted right by 1111111101000111= 32,583, discarding the low bit
These bits as a double3.21967759 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime65,171+4
Previous prime65,147−20
Distance to nearest prime0, it is prime
Nearest square below65,025
Nearest square above65,536

Powers & multiples

65,167 to the power 24,246,737,889
65,167 to the power 3276,747,168,012,463
65,167 to the power 418,034,782,697,868,176,321
65,167 to the power 51,175,272,684,071,975,446,310,607
First ten multiples65,167, 130,334, 195,501, 260,668, 325,835, 391,002, 456,169, 521,336, 586,503, 651,670
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 4
Divisible by 8No, remainder 7
Divisible by 9No, remainder 7
Divisible by 10No, remainder 7
Divisible by 11No, remainder 3
Divisible by 12No, remainder 7
Divisible by 100No, remainder 67

Collatz (3n + 1) trajectory

Steps to reach 1223the total stopping time
Highest value reached659,82410× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps65,167 → 195,502 → 97,751 → 293,254 → 146,627 → 439,882 → 219,941 → 659,824 → 329,912 → 164,956 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage6,516,700%
65,167% as a decimal651.67
65,167% of 10065,167
65,167% of 1,000651,670
As a fraction of 10065,167/100

Read another way

As bytes63.64 KiB
As a 24-bit colour#00FE8F

Keep nerding

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

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “65167” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.