Nerdulator> put something in

Number

66,601

  • Positive
  • Odd
  • Prime
  • 5 digits

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

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value66,601
Digit count5
Digit sum19
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation66,601
Distinct prime factors166,601
Number of divisors2
Sum of divisors σ(n)66,602
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)66,600integers below n that share no factor with it
SquarefreeYesno repeated prime factor
All divisors1, 66,6012 in total

Arithmetic

Previous number66,600
Next number66,602
Double133,202
Square root258.071695465irrational, shown to 9 decimal places
Cube root40.534695666
Negation-66,601
Reciprocal0.0000150148

Representations

Decimal66,601
Binary1000001000010100117 bits
Octal202051
Hexadecimal10429
Base 361FE1
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssixty-six thousand, six hundred and one
Ordinalsixty-six thousand, six hundred and first
Scientific notation6.6601 × 10^4
Engineering notation66.601 × 10^3

Nearest landmarks

Next prime66,617+16
Previous prime66,593−8
Distance to nearest prime0, it is prime
Nearest square below66,564
Nearest square above67,081

Powers & multiples

66,601 to the power 24,435,693,201
66,601 to the power 3295,421,602,879,801
66,601 to the power 419,675,374,173,397,626,401
66,601 to the power 51,310,399,595,322,455,315,933,001
First ten multiples66,601, 133,202, 199,803, 266,404, 333,005, 399,606, 466,207, 532,808, 599,409, 666,010
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 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 3
Divisible by 8No, remainder 1
Divisible by 9No, remainder 1
Divisible by 10No, remainder 1
Divisible by 11No, remainder 7
Divisible by 12No, remainder 1
Divisible by 100No, remainder 1

Collatz (3n + 1) trajectory

Steps to reach 199the total stopping time
Highest value reached758,64411× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps66,601 → 199,804 → 99,902 → 49,951 → 149,854 → 74,927 → 224,782 → 112,391 → 337,174 → 168,587 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage6,660,100%
66,601% as a decimal666.01
66,601% of 10066,601
66,601% of 1,000666,010
As a fraction of 10066,601/100

Read another way

As bytes65.04 KiB
As a 24-bit colour#010429

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