Recognised as Number
4,003,642
- Positive
- Even
- Composite
- 7 digits
4,003,642 is an even 7-digit integer and a composite number. It has 8 divisors and a digital root of 1.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value4,003,642
Digit count7
Digit sum19
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberYesdivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 19 × 105,359
Distinct prime factors32, 19, 105,359
Number of divisors8
Sum of divisors σ(n)6,321,600
Aliquot sum2,317,958sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,896,444integers below n that share no factor with it
Carmichael function λ(n)948,222the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,896,444
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 19, 38, 105,359, 210,718, 2,001,821, 4,003,6428 in total
Arithmetic
Previous number4,003,641
Next number4,003,643
Double8,007,284
Half2,001,821
Square16,029,149,264,164
Cube64,174,975,218,276,085,288
Square root2,000.910292842≈irrational, shown to 9 decimal places
Cube root158.788268204≈
Negation-4,003,642
Reciprocal2.49772582 × 10^-7≈
Representations
Decimal4,003,642
Binary111101000101110011101022 bits
Octal17213472
Hexadecimal3D173A
Base 362DT8A
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, three thousand, six hundred and forty-two
Ordinalfour million, three thousand, six hundred and forty-second
Scientific notation4.003642 × 10^6
Engineering notation4.003642 × 10^6
In other bases
Ternary21112101222001base 3; the most digit-efficient integer base after e: 14 digits
Quinary2011104032base 5; one hand: 10 digits
Septenary46013266base 7: 8 digits
Nonary7471861base 9; each digit is two ternary digits: 7 digits
Duodecimal1410b0abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal150922base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal18:32:7:22base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10TTTT11T00T001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10011010110101101001110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001111010001011100111010
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 17 3a
Gray code1000111001110010100111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001111010001011100111010
64-bit0000000000000000000000000000000000000000001111010001011100111010
One's complement11111111110000101110100011000101at 32 bits, every bit flipped
Bits reversed01011100111010001011110000000000at 32 bits
Rotated left by 100000000011110100010111001110100at 32 bits, wrapping
Shifted left by 111110100010111001110100= 8,007,284, no wrap
Shifted right by 1111101000101110011101= 2,001,821, discarding the low bit
These bits as a double1.97806197 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,003,642 to the power 216,029,149,264,164
4,003,642 to the power 364,174,975,218,276,085,288
4,003,642 to the power 4256,933,626,132,849,302,654,618,896
4,003,642 to the power 51,028,670,256,797,773,047,778,743,706,019,232
First ten multiples4,003,642, 8,007,284, 12,010,926, 16,014,568, 20,018,210, 24,021,852, 28,025,494, 32,029,136, 36,032,778, 40,036,420
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4No, remainder 2
Divisible by 5No, remainder 2
Divisible by 6No, remainder 4
Divisible by 7No, remainder 6
Divisible by 8No, remainder 2
Divisible by 9No, remainder 1
Divisible by 10No, remainder 2
Divisible by 11No, remainder 5
Divisible by 12No, remainder 10
Divisible by 100No, remainder 42
Collatz (3n + 1) trajectory
Steps to reach 1291the total stopping time
Highest value reached487,463,344121× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,003,642 → 2,001,821 → 6,005,464 → 3,002,732 → 1,501,366 → 750,683 → 2,252,050 → 1,126,025 → 3,378,076 → 1,689,038 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage400,364,200%
4,003,642% as a decimal40,036.42
4,003,642% of 1004,003,642
4,003,642% of 1,00040,036,420
As a fraction of 1004,003,642/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 4,003,642
Nerdulate something else
Nothing in mind? Surprise me · today’s page