Recognised as Number

4,006,590

Positive
Even
Composite
7 digits

4,006,590 is an even 7-digit integer and a composite number. It has 32 divisors and a digital root of 6.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value4,006,590

Digit count7

Digit sum24

Digit product0zero, because one of the digits is zero

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

Digital root6repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 3 × 5 × 7 × 19,079

Distinct prime factors52, 3, 5, 7, 19,079

Number of divisors32

Sum of divisors σ(n)10,990,080

Aliquot sum6,983,490sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

Euler's totient φ(n)915,744integers below n that share no factor with it

Carmichael function λ(n)114,468the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 915,744

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

SquarefreeYesno repeated prime factor

All divisors1, 2, 3, 5, 6, 7, 10, 14, 15, 21, 30, 35, 42, 70, 105, 210, 19,079, 38,158, 57,237, 95,395, 114,474, 133,553, 190,790, 267,106, 286,185, 400,659, 572,370, 667,765, 801,318, 1,335,530, 2,003,295, 4,006,59032 in total

Arithmetic

Previous number4,006,589

Next number4,006,591

Double8,013,180

Half2,003,295

Square16,052,763,428,100

Cube64,316,841,423,391,179,000

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

Cube root158.827232142≈

Negation-4,006,590

Reciprocal2.49588802 × 10^-7≈

Representations

Decimal4,006,590

Binary111101001000101011111022 bits

Octal17221276

Hexadecimal3D22BE

Base 362DVI6

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

In wordsfour million, six thousand, five hundred and ninety

Ordinalfour million, six thousand, five hundred and ninetieth

Scientific notation4.00659 × 10^6

Engineering notation4.00659 × 10^6

In other bases

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

Quinary2011202330base 5; one hand: 10 digits

Septenary46025010base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000001111010010001010111110

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 even

Highest set bitbit 21worth 2,097,152

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes33d 22 be

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

At each machine width

32-bit00000000001111010010001010111110

64-bit0000000000000000000000000000000000000000001111010010001010111110

One's complement11111111110000101101110101000001at 32 bits, every bit flipped

Bits reversed01111101010001001011110000000000at 32 bits

Rotated left by 100000000011110100100010101111100at 32 bits, wrapping

Shifted left by 111110100100010101111100= 8,013,180, no wrap

Shifted right by 1111101001000101011111= 2,003,295, discarding the low bit

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

Nearest landmarks

Next prime4,006,591+1

Previous prime4,006,589−1

Distance to nearest prime1

Nearest square below4,004,001

Nearest square above4,008,004

Powers & multiples

4,006,590 to the power 216,052,763,428,100

4,006,590 to the power 364,316,841,423,391,179,000

4,006,590 to the power 4257,691,213,678,544,863,869,610,000

4,006,590 to the power 51,032,463,039,812,321,066,131,340,729,900,000

First ten multiples4,006,590, 8,013,180, 12,019,770, 16,026,360, 20,032,950, 24,039,540, 28,046,130, 32,052,720, 36,059,310, 40,065,900

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

Divisibility tests

Divisible by 2Yes

Divisible by 3Yes

Divisible by 4No, remainder 2

Divisible by 5Yes

Divisible by 6Yes

Divisible by 7Yes

Divisible by 8No, remainder 6

Divisible by 9No, remainder 6

Divisible by 10Yes

Divisible by 11No, remainder 5

Divisible by 12No, remainder 6

Divisible by 100No, remainder 90

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,590 → 2,003,295 → 6,009,886 → 3,004,943 → 9,014,830 → 4,507,415 → 13,522,246 → 6,761,123 → 20,283,370 → 10,141,685 → …

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

As a percentage & fraction

As a percentage400,659,000%

4,006,590% as a decimal40,065.9

4,006,590% of 1004,006,590

4,006,590% of 1,00040,065,900

As a fraction of 1004,006,590/100

Read another way

As seconds46 days, 8 hours and 56 minutes

As bytes3.821 MiB

As a 24-bit colour#3D22BE

Keep nerding

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