Recognised as Number
66,970
- Positive
- Even
- Composite
- 5 digits
66,970 is an even 5-digit integer and a composite number. It has 16 divisors and a digital root of 1.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value66,970
Digit count5
Digit sum28
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 5 × 37 × 181
Distinct prime factors42, 5, 37, 181
Number of divisors16
Sum of divisors σ(n)124,488
Aliquot sum57,518sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)25,920integers below n that share no factor with it
Carmichael function λ(n)180the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 25,920
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 5, 10, 37, 74, 181, 185, 362, 370, 905, 1,810, 6,697, 13,394, 33,485, 66,97016 in total
Arithmetic
Representations
Decimal66,970
Binary1000001011001101017 bits
Octal202632
Hexadecimal1059A
Base 361FOA
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssixty-six thousand, nine hundred and seventy
Ordinalsixty-six thousand, nine hundred and seventieth
Scientific notation6.697 × 10^4
Engineering notation66.97 × 10^3
In other bases
Ternary10101212101base 3; the most digit-efficient integer base after e: 11 digits
Quinary4120340base 5; one hand: 7 digits
Septenary366151base 7: 6 digits
Nonary111771base 9; each digit is two ternary digits: 6 digits
Duodecimal3290abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal878abase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal18:36:10base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1011T0TT101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10001101011101110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010000010110011010
Bit length17 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits10within that length
Bit parityodd7 set bits, so odd; not the same as the number itself being even
Highest set bitbit 16worth 65,536
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes301 05 9a
Gray code11000011101010111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010000010110011010
64-bit0000000000000000000000000000000000000000000000010000010110011010
One's complement11111111111111101111101001100101at 32 bits, every bit flipped
Bits reversed01011001101000001000000000000000at 32 bits
Rotated left by 100000000000000100000101100110100at 32 bits, wrapping
Shifted left by 1100000101100110100= 133,940, no wrap
Shifted right by 11000001011001101= 33,485, discarding the low bit
These bits as a double3.30875763 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
66,970 to the power 24,484,980,900
66,970 to the power 3300,359,170,873,000
66,970 to the power 420,115,053,673,364,810,000
66,970 to the power 51,347,105,144,505,241,325,700,000
First ten multiples66,970, 133,940, 200,910, 267,880, 334,850, 401,820, 468,790, 535,760, 602,730, 669,700
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4No, remainder 2
Divisible by 5Yes
Divisible by 6No, remainder 4
Divisible by 7No, remainder 1
Divisible by 8No, remainder 2
Divisible by 9No, remainder 1
Divisible by 10Yes
Divisible by 11No, remainder 2
Divisible by 12No, remainder 10
Divisible by 100No, remainder 70
Collatz (3n + 1) trajectory
Steps to reach 142the total stopping time
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps66,970 → 33,485 → 100,456 → 50,228 → 25,114 → 12,557 → 37,672 → 18,836 → 9,418 → 4,709 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage6,697,000%
66,970% as a decimal669.7
66,970% of 10066,970
66,970% of 1,000669,700
As a fraction of 10066,970/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 66,970
Nerdulate something else
Nothing in mind? Surprise me · today’s page