Nerdulator> put something in

Recognised as Number

66,959

  • Positive
  • Odd
  • Prime
  • 5 digits

66,959 is an odd 5-digit integer and a prime number. It has 2 divisors and a digital root of 8.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value66,959
Digit count5
Digit sum35
Digit product14,580
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation66,959
Distinct prime factors166,959
Number of divisors2
Sum of divisors σ(n)66,960
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)66,958integers below n that share no factor with it
Carmichael function λ(n)66,958the 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, 66,9592 in total

Arithmetic

Previous number66,958
Next number66,960
Double133,918
Square root258.764371582≈irrational, shown to 9 decimal places
Cube root40.607194564≈
Negation-66,959
Reciprocal0.0000149345≈

Representations

Decimal66,959
Binary1000001011000111117 bits
Octal202617
Hexadecimal1058F
Base 361FNZ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssixty-six thousand, nine hundred and fifty-nine
Ordinalsixty-six thousand, nine hundred and fifty-ninth
Scientific notation6.6959 × 10^4
Engineering notation66.959 × 10^3

In other bases

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

Bit-level

00000000000000010000010110001111
Bit length17 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits9within that length
Bit parityeven8 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 05 8f
Gray code11000011101001000n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000000010000010110001111
64-bit0000000000000000000000000000000000000000000000010000010110001111
One's complement11111111111111101111101001110000at 32 bits, every bit flipped
Bits reversed11110001101000001000000000000000at 32 bits
Rotated left by 100000000000000100000101100011110at 32 bits, wrapping
Shifted left by 1100000101100011110= 133,918, no wrap
Shifted right by 11000001011000111= 33,479, discarding the low bit
These bits as a double3.30821416 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime66,973+14
Previous prime66,949−10
Distance to nearest prime0, it is prime
Nearest square below66,564
Nearest square above67,081

Powers & multiples

66,959 to the power 24,483,507,681
66,959 to the power 3300,211,190,812,079
66,959 to the power 420,101,841,125,585,997,761
66,959 to the power 51,345,999,179,928,112,824,078,799
First ten multiples66,959, 133,918, 200,877, 267,836, 334,795, 401,754, 468,713, 535,672, 602,631, 669,590
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 3
Divisible by 5No, remainder 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 7
Divisible by 9No, remainder 8
Divisible by 10No, remainder 9
Divisible by 11No, remainder 2
Divisible by 12No, remainder 11
Divisible by 100No, remainder 59

Collatz (3n + 1) trajectory

Steps to reach 1143the total stopping time
Highest value reached677,96810× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps66,959 → 200,878 → 100,439 → 301,318 → 150,659 → 451,978 → 225,989 → 677,968 → 338,984 → 169,492 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage6,695,900%
66,959% as a decimal669.59
66,959% of 10066,959
66,959% of 1,000669,590
As a fraction of 10066,959/100

Read another way

As bytes65.39 KiB
As a 24-bit colour#01058F

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 “66959” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.