Nerdulator> put something in

Recognised as Number

39,670

  • Positive
  • Even
  • Composite
  • 5 digits

39,670 is an even 5-digit integer and a composite number. It has 8 divisors and a digital root of 7.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value39,670
Digit count5
Digit sum25
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 factorisation2 × 5 × 3,967
Distinct prime factors32, 5, 3,967
Number of divisors8
Sum of divisors σ(n)71,424
Aliquot sum31,754sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)15,864integers below n that share no factor with it
Carmichael function λ(n)7,932the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 15,864
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 5, 10, 3,967, 7,934, 19,835, 39,6708 in total

Arithmetic

Previous number39,669
Next number39,671
Double79,340
Half19,835
Square root199.173291382≈irrational, shown to 9 decimal places
Cube root34.105210431≈
Negation-39,670
Reciprocal0.000025208≈

Representations

Decimal39,670
Binary100110101111011016 bits
Octal115366
Hexadecimal9AF6
Base 36ULY
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthirty-nine thousand, six hundred and seventy
Ordinalthirty-nine thousand, six hundred and seventieth
Scientific notation3.967 × 10^4
Engineering notation39.67 × 10^3

In other bases

Ternary2000102021base 3; the most digit-efficient integer base after e: 10 digits
Quinary2232140base 5; one hand: 7 digits
Septenary223441base 7: 6 digits
Nonary60367base 9; each digit is two ternary digits: 5 digits
Duodecimal1ab5abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal4j3abase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal11:1:10base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1T00011T1T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11110111100001010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1001101011110110
Bit length16 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits6within that length
Bit parityeven10 set bits, so even; not the same as the number itself being even
Highest set bitbit 15worth 32,768
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes29a f6
Gray code1101011110001101n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1001101011110110
32-bit00000000000000001001101011110110
64-bit0000000000000000000000000000000000000000000000001001101011110110
One's complement0110010100001001at 16 bits, every bit flipped
Bits reversed0110111101011001at 16 bits
Rotated left by 10011010111101101at 16 bits, wrapping
Shifted left by 110011010111101100= 79,340, no wrap
Shifted right by 1100110101111011= 19,835, discarding the low bit
These bits as a double1.95995842 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime39,671+1
Previous prime39,667−3
Distance to nearest prime1
Nearest square below39,601
Nearest square above40,000

Powers & multiples

39,670 to the power 21,573,708,900
39,670 to the power 362,429,032,063,000
39,670 to the power 42,476,559,701,939,210,000
39,670 to the power 598,245,123,375,928,460,700,000
First ten multiples39,670, 79,340, 119,010, 158,680, 198,350, 238,020, 277,690, 317,360, 357,030, 396,700
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

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 6
Divisible by 9No, remainder 7
Divisible by 10Yes
Divisible by 11No, remainder 4
Divisible by 12No, remainder 10
Divisible by 100No, remainder 70

Collatz (3n + 1) trajectory

Steps to reach 149the total stopping time
Highest value reached100,4202× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps39,670 → 19,835 → 59,506 → 29,753 → 89,260 → 44,630 → 22,315 → 66,946 → 33,473 → 100,420 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage3,967,000%
39,670% as a decimal396.7
39,670% of 10039,670
39,670% of 1,000396,700
As a fraction of 10039,670/100

Read another way

As bytes38.74 KiB
As a 24-bit colour#009AF6

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