Recognised as Number

66,337

Positive
Odd
Prime
5 digits

66,337 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 value66,337

Digit count5

Digit sum25

Digit product2,268

Multiplicative persistence4times the digit product can be taken before one digit is left

Digital root7repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation66,337

Distinct prime factors166,337

Number of divisors2

Sum of divisors σ(n)66,338

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)66,336integers below n that share no factor with it

Carmichael function λ(n)66,336the 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,3372 in total

Arithmetic

Previous number66,336

Next number66,338

Double132,674

Half33,168.5

Square4,400,597,569

Cube291,922,440,934,753

Square root257.559701817≈irrational, shown to 9 decimal places

Cube root40.481066189≈

Negation-66,337

Reciprocal0.0000150745≈

Representations

Decimal66,337

Binary1000000110010000117 bits

Octal201441

Hexadecimal10321

Base 361F6P

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordssixty-six thousand, three hundred and thirty-seven

Ordinalsixty-six thousand, three hundred and thirty-seventh

Scientific notation6.6337 × 10^4

Engineering notation66.337 × 10^3

In other bases

Ternary10100222221base 3; the most digit-efficient integer base after e: 11 digits

Quinary4110322base 5; one hand: 7 digits

Septenary364255base 7: 6 digits

Nonary110887base 9; each digit is two ternary digits: 6 digits

Duodecimal32481base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits

Vigesimal85ghbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits

Sexagesimal18:25:37base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

Balanced ternary101010000T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary10000011101100001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000000010000001100100001

Bit length17 bitsto write the magnitude

Set bits5the population count, or Hamming weight

Zero bits12within that length

Bit parityodd5 set bits, so odd; 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 03 21

Gray code11000001010110001n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000000010000001100100001

64-bit0000000000000000000000000000000000000000000000010000001100100001

One's complement11111111111111101111110011011110at 32 bits, every bit flipped

Bits reversed10000100110000001000000000000000at 32 bits

Rotated left by 100000000000000100000011001000010at 32 bits, wrapping

Shifted left by 1100000011001000010= 132,674, no wrap

Shifted right by 11000000110010000= 33,168, discarding the low bit

These bits as a double3.27748327 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime66,343+6

Previous prime66,301−36

Distance to nearest prime0, it is prime

Nearest square below66,049

Nearest square above66,564

Powers & multiples

66,337 to the power 24,400,597,569

66,337 to the power 3291,922,440,934,753

66,337 to the power 419,365,258,964,288,709,761

66,337 to the power 51,284,633,183,914,020,139,415,457

First ten multiples66,337, 132,674, 199,011, 265,348, 331,685, 398,022, 464,359, 530,696, 597,033, 663,370

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 5

Divisible by 8No, remainder 1

Divisible by 9No, remainder 7

Divisible by 10No, remainder 7

Divisible by 11No, remainder 7

Divisible by 12No, remainder 1

Divisible by 100No, remainder 37

Collatz (3n + 1) trajectory

Steps to reach 199the total stopping time

Highest value reached538,0008× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps66,337 → 199,012 → 99,506 → 49,753 → 149,260 → 74,630 → 37,315 → 111,946 → 55,973 → 167,920 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage6,633,700%

66,337% as a decimal663.37

66,337% of 10066,337

66,337% of 1,000663,370

As a fraction of 10066,337/100

Read another way

As seconds18 hours, 25 minutes and 37 seconds

As bytes64.782 KiB

As a 24-bit colour#010321

Keep nerding

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