Recognised as Number

1,609,321

Positive
Odd
Composite
7 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value1,609,321

Digit count7

Digit sum22

Digit product0zero, because one of the digits is zero

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

Digital root4repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation7 × 229,903

Distinct prime factors27, 229,903

Number of divisors4

Sum of divisors σ(n)1,839,232

Aliquot sum229,911sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)1,379,412integers below n that share no factor with it

Carmichael function λ(n)229,902the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,379,412

Möbius function μ(n)+12 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 7, 229,903, 1,609,3214 in total

Arithmetic

Previous number1,609,320

Next number1,609,322

Double3,218,642

Half804,660.5

Square2,589,914,081,041

Cube4,168,003,118,814,983,161

Square root1,268.590162346≈irrational, shown to 9 decimal places

Cube root117.187392984≈

Negation-1,609,321

Reciprocal6.21380073 × 10^-7≈

Representations

Decimal1,609,321

Binary11000100011100110100121 bits

Octal6107151

Hexadecimal188E69

Base 36YHRD

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

In wordsone million, six hundred and nine thousand, three hundred and twenty-one

Ordinalone million, six hundred and nine thousand, three hundred and twenty-first

Scientific notation1.609321 × 10^6

Engineering notation1.609321 × 10^6

In other bases

Ternary10000202120111base 3; the most digit-efficient integer base after e: 14 digits

Quinary402444241base 5; one hand: 9 digits

Septenary16451620base 7: 8 digits

Nonary3022514base 9; each digit is two ternary digits: 7 digits

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

Vigesimala1361base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits

Sexagesimal7:27:2:1base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000110001000111001101001

Bit length21 bitsto write the magnitude

Set bits10the population count, or Hamming weight

Zero bits11within that length

Bit parityeven10 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

Bytes318 8e 69

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

At each machine width

32-bit00000000000110001000111001101001

64-bit0000000000000000000000000000000000000000000110001000111001101001

One's complement11111111111001110111000110010110at 32 bits, every bit flipped

Bits reversed10010110011100010001100000000000at 32 bits

Rotated left by 100000000001100010001110011010010at 32 bits, wrapping

Shifted left by 11100010001110011010010= 3,218,642, no wrap

Shifted right by 111000100011100110100= 804,660, discarding the low bit

These bits as a double7.95110219 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime1,609,367+46

Previous prime1,609,301−20

Distance to nearest prime20

Nearest square below1,607,824

Nearest square above1,610,361

Powers & multiples

1,609,321 to the power 22,589,914,081,041

1,609,321 to the power 34,168,003,118,814,983,161

1,609,321 to the power 46,707,654,947,174,447,515,643,681

1,609,321 to the power 510,794,769,967,241,729,050,323,204,350,601

First ten multiples1,609,321, 3,218,642, 4,827,963, 6,437,284, 8,046,605, 9,655,926, 11,265,247, 12,874,568, 14,483,889, 16,093,210

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 1

Divisible by 4No, remainder 1

Divisible by 5No, remainder 1

Divisible by 6No, remainder 1

Divisible by 7Yes

Divisible by 8No, remainder 1

Divisible by 9No, remainder 4

Divisible by 10No, remainder 1

Divisible by 11No, remainder 10

Divisible by 12No, remainder 1

Divisible by 100No, remainder 21

Collatz (3n + 1) trajectory

Steps to reach 1119the total stopping time

Highest value reached15,466,9489× the starting value

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

First steps1,609,321 → 4,827,964 → 2,413,982 → 1,206,991 → 3,620,974 → 1,810,487 → 5,431,462 → 2,715,731 → 8,147,194 → 4,073,597 → …

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

As a percentage & fraction

As a percentage160,932,100%

1,609,321% as a decimal16,093.21

1,609,321% of 1001,609,321

1,609,321% of 1,00016,093,210

As a fraction of 1001,609,321/100

Read another way

As seconds18 days, 15 hours and 2 minutes

As bytes1.535 MiB

As a 24-bit colour#188E69

Keep nerding

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