Nerdulator> put something in

Recognised as Number

1,665,341

  • Positive
  • Odd
  • Composite
  • 7 digits

1,665,341 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 8.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,665,341
Digit count7
Digit sum26
Digit product2,160
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 factorisation449 × 3,709
Distinct prime factors2449, 3,709
Number of divisors4
Sum of divisors σ(n)1,669,500
Aliquot sum4,159sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,661,184integers below n that share no factor with it
Carmichael function λ(n)415,296the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,661,184
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 449, 3,709, 1,665,3414 in total

Arithmetic

Previous number1,665,340
Next number1,665,342
Double3,330,682
Cube4,618,591,192,038,246,821
Square root1,290.480918108≈irrational, shown to 9 decimal places
Cube root118.531666779≈
Negation-1,665,341
Reciprocal6.0047762 × 10^-7≈

Representations

Decimal1,665,341
Binary11001011010010011110121 bits
Octal6264475
Hexadecimal19693D
Base 36ZOZH
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, six hundred and sixty-five thousand, three hundred and forty-one
Ordinalone million, six hundred and sixty-five thousand, three hundred and forty-first
Scientific notation1.665341 × 10^6
Engineering notation1.665341 × 10^6

In other bases

Ternary10010121102022base 3; the most digit-efficient integer base after e: 14 digits
Quinary411242331base 5; one hand: 9 digits
Septenary20104136base 7: 8 digits
Nonary3117368base 9; each digit is two ternary digits: 7 digits
Duodecimal6838a5base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimala8371base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal7:42:35:41base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10011TT111T10Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11011101011100101001101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000110010110100100111101
Bit length21 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits9within that length
Bit parityeven12 set bits, so even; not the same as the number itself being odd
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes319 69 3d
Gray code101011101110110100011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000110010110100100111101
64-bit0000000000000000000000000000000000000000000110010110100100111101
One's complement11111111111001101001011011000010at 32 bits, every bit flipped
Bits reversed10111100100101101001100000000000at 32 bits
Rotated left by 100000000001100101101001001111010at 32 bits, wrapping
Shifted left by 11100101101001001111010= 3,330,682, no wrap
Shifted right by 111001011010010011110= 832,670, discarding the low bit
These bits as a double8.22787777 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime1,665,343+2
Previous prime1,665,317−24
Distance to nearest prime2
Nearest square below1,664,100
Nearest square above1,666,681

Powers & multiples

1,665,341 to the power 22,773,360,646,281
1,665,341 to the power 34,618,591,192,038,246,821
1,665,341 to the power 47,691,529,274,340,165,999,130,961
1,665,341 to the power 512,809,019,053,258,926,385,158,753,722,701
First ten multiples1,665,341, 3,330,682, 4,996,023, 6,661,364, 8,326,705, 9,992,046, 11,657,387, 13,322,728, 14,988,069, 16,653,410
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)

Divisibility tests

Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 6
Divisible by 8No, remainder 5
Divisible by 9No, remainder 8
Divisible by 10No, remainder 1
Divisible by 11No, remainder 7
Divisible by 12No, remainder 5
Divisible by 100No, remainder 41

Collatz (3n + 1) trajectory

Steps to reach 1163the total stopping time
Highest value reached4,996,0243× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,665,341 → 4,996,024 → 2,498,012 → 1,249,006 → 624,503 → 1,873,510 → 936,755 → 2,810,266 → 1,405,133 → 4,215,400 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage166,534,100%
1,665,341% as a decimal16,653.41
1,665,341% of 1001,665,341
1,665,341% of 1,00016,653,410
As a fraction of 1001,665,341/100

Read another way

As bytes1.588 MiB
As a 24-bit colour#19693D

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