Recognised as Number

4,006,589

Positive
Odd
Prime
7 digits

4,006,589 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 5.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value4,006,589

Digit count7

Digit sum32

Digit product0zero, because one of the digits is zero

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

Digital root5repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation4,006,589

Distinct prime factors14,006,589

Number of divisors2

Sum of divisors σ(n)4,006,590

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)4,006,588integers below n that share no factor with it

Carmichael function λ(n)4,006,588the smallest exponent with aˣ ≡ 1 for every unit coprime to n

Möbius function μ(n)−11 distinct prime factor, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 4,006,5892 in total

Arithmetic

Previous number4,006,588

Next number4,006,590

Double8,013,178

Half2,003,294.5

Square16,052,755,414,921

Cube64,316,793,265,112,914,469

Square root2,001.6465722≈irrational, shown to 9 decimal places

Cube root158.827218928≈

Negation-4,006,589

Reciprocal2.49588865 × 10^-7≈

Representations

Decimal4,006,589

Binary111101001000101011110122 bits

Octal17221275

Hexadecimal3D22BD

Base 362DVI5

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

In wordsfour million, six thousand, five hundred and eighty-nine

Ordinalfour million, six thousand, five hundred and eighty-ninth

Scientific notation4.006589 × 10^6

Engineering notation4.006589 × 10^6

In other bases

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

Quinary2011202324base 5; one hand: 10 digits

Septenary46025006base 7: 8 digits

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

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

Vigesimal150g99base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits

Sexagesimal18:32:56:29base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000001111010010001010111101

Bit length22 bitsto write the magnitude

Set bits13the population count, or Hamming weight

Zero bits9within that length

Bit parityodd13 set bits, so odd; 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

Bytes33d 22 bd

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

At each machine width

32-bit00000000001111010010001010111101

64-bit0000000000000000000000000000000000000000001111010010001010111101

One's complement11111111110000101101110101000010at 32 bits, every bit flipped

Bits reversed10111101010001001011110000000000at 32 bits

Rotated left by 100000000011110100100010101111010at 32 bits, wrapping

Shifted left by 111110100100010101111010= 8,013,178, no wrap

Shifted right by 1111101001000101011110= 2,003,294, discarding the low bit

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

Nearest landmarks

Next prime4,006,591+2

Previous prime4,006,571−18

Distance to nearest prime0, it is prime

Nearest square below4,004,001

Nearest square above4,008,004

Powers & multiples

4,006,589 to the power 216,052,755,414,921

4,006,589 to the power 364,316,793,265,112,914,469

4,006,589 to the power 4257,690,956,411,275,486,869,436,241

4,006,589 to the power 51,032,461,751,356,895,841,660,727,679,391,949

First ten multiples4,006,589, 8,013,178, 12,019,767, 16,026,356, 20,032,945, 24,039,534, 28,046,123, 32,052,712, 36,059,301, 40,065,890

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 6

Divisible by 8No, remainder 5

Divisible by 9No, remainder 5

Divisible by 10No, remainder 9

Divisible by 11No, remainder 4

Divisible by 12No, remainder 5

Divisible by 100No, remainder 89

Collatz (3n + 1) trajectory

Steps to reach 1229the total stopping time

Highest value reached117,096,35229× the starting value

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

First steps4,006,589 → 12,019,768 → 6,009,884 → 3,004,942 → 1,502,471 → 4,507,414 → 2,253,707 → 6,761,122 → 3,380,561 → 10,141,684 → …

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

As a percentage & fraction

As a percentage400,658,900%

4,006,589% as a decimal40,065.89

4,006,589% of 1004,006,589

4,006,589% of 1,00040,065,890

As a fraction of 1004,006,589/100

Read another way

As seconds46 days, 8 hours and 56 minutes

As bytes3.821 MiB

As a 24-bit colour#3D22BD

Keep nerding

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