Recognised as Number

2,983,409

Positive
Odd
Composite
7 digits

2,983,409 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 8.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value2,983,409

Digit count7

Digit sum35

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times 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 factorisation11 × 13 × 31 × 673

Distinct prime factors411, 13, 31, 673

Number of divisors16

Sum of divisors σ(n)3,623,424

Aliquot sum640,015sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)2,419,200integers below n that share no factor with it

Carmichael function λ(n)3,360the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,419,200

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

SquarefreeYesno repeated prime factor

All divisors1, 11, 13, 31, 143, 341, 403, 673, 4,433, 7,403, 8,749, 20,863, 96,239, 229,493, 271,219, 2,983,40916 in total

Arithmetic

Previous number2,983,408

Next number2,983,410

Double5,966,818

Half1,491,704.5

Square8,900,729,261,281

Cube26,554,515,784,669,086,929

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

Cube root143.958594706≈

Negation-2,983,409

Reciprocal3.35187029 × 10^-7≈

Representations

Decimal2,983,409

Binary101101100001011111000122 bits

Octal13302761

Hexadecimal2D85F1

Base 361RY0H

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

In wordstwo million, nine hundred and eighty-three thousand, four hundred and nine

Ordinaltwo million, nine hundred and eighty-three thousand, four hundred and ninth

Scientific notation2.983409 × 10^6

Engineering notation2.983409 × 10^6

In other bases

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

Quinary1230432114base 5; one hand: 10 digits

Septenary34233662base 7: 8 digits

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

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

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

Sexagesimal13:48:43:29base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000001011011000010111110001

Bit length22 bitsto write the magnitude

Set bits12the population count, or Hamming weight

Zero bits10within that length

Bit parityeven12 set bits, so even; not the same as the number itself being odd

Highest set bitbit 21worth 2,097,152

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes32d 85 f1

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

At each machine width

32-bit00000000001011011000010111110001

64-bit0000000000000000000000000000000000000000001011011000010111110001

One's complement11111111110100100111101000001110at 32 bits, every bit flipped

Bits reversed10001111101000011011010000000000at 32 bits

Rotated left by 100000000010110110000101111100010at 32 bits, wrapping

Shifted left by 110110110000101111100010= 5,966,818, no wrap

Shifted right by 1101101100001011111000= 1,491,704, discarding the low bit

These bits as a double1.47399989 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2,983,411+2

Previous prime2,983,403−6

Distance to nearest prime2

Nearest square below2,982,529

Nearest square above2,985,984

Powers & multiples

2,983,409 to the power 28,900,729,261,281

2,983,409 to the power 326,554,515,784,669,086,929

2,983,409 to the power 479,222,981,382,623,815,965,760,961

2,983,409 to the power 5236,354,555,663,752,336,166,594,942,896,049

First ten multiples2,983,409, 5,966,818, 8,950,227, 11,933,636, 14,917,045, 17,900,454, 20,883,863, 23,867,272, 26,850,681, 29,834,090

Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 2

Divisible by 4No, remainder 1

Divisible by 5No, remainder 4

Divisible by 6No, remainder 5

Divisible by 7No, remainder 2

Divisible by 8No, remainder 1

Divisible by 9No, remainder 8

Divisible by 10No, remainder 9

Divisible by 11Yes

Divisible by 12No, remainder 5

Divisible by 100No, remainder 9

Collatz (3n + 1) trajectory

Steps to reach 163the total stopping time

Highest value reached8,950,2283× the starting value

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

First steps2,983,409 → 8,950,228 → 4,475,114 → 2,237,557 → 6,712,672 → 3,356,336 → 1,678,168 → 839,084 → 419,542 → 209,771 → …

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

As a percentage & fraction

As a percentage298,340,900%

2,983,409% as a decimal29,834.09

2,983,409% of 1002,983,409

2,983,409% of 1,00029,834,090

As a fraction of 1002,983,409/100

Read another way

As seconds34 days, 12 hours and 43 minutes

As bytes2.845 MiB

As a 24-bit colour#2D85F1

Keep nerding

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