Recognised as Number
4,003,867
- Positive
- Odd
- Composite
- 7 digits
4,003,867 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value4,003,867
Digit count7
Digit sum28
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 numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation7 × 31 × 18,451
Distinct prime factors37, 31, 18,451
Number of divisors8
Sum of divisors σ(n)4,723,712
Aliquot sum719,845sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,321,000integers below n that share no factor with it
Carmichael function λ(n)18,450the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,321,000
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 7, 31, 217, 18,451, 129,157, 571,981, 4,003,8678 in total
Arithmetic
Previous number4,003,866
Next number4,003,868
Double8,007,734
Half2,001,933.5
Square16,030,950,953,689
Cube64,185,795,502,093,915,363
Square root2,000.966516461≈irrational, shown to 9 decimal places
Cube root158.79124272≈
Negation-4,003,867
Reciprocal2.49758546 × 10^-7≈
Representations
Decimal4,003,867
Binary111101000110000001101122 bits
Octal17214033
Hexadecimal3D181B
Base 362DTEJ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, three thousand, eight hundred and sixty-seven
Ordinalfour million, three thousand, eight hundred and sixty-seventh
Scientific notation4.003867 × 10^6
Engineering notation4.003867 × 10^6
In other bases
Ternary21112102021101base 3; the most digit-efficient integer base after e: 14 digits
Quinary2011110432base 5; one hand: 10 digits
Septenary46014040base 7: 8 digits
Nonary7472241base 9; each digit is two ternary digits: 7 digits
Duodecimal1411077base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1509d7base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal18:32:11:7base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10TTTT11T1T1101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10011010110100001101111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001111010001100000011011
Bit length22 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits11within that length
Bit parityodd11 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 18 1b
Gray code1000111001010000010110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001111010001100000011011
64-bit0000000000000000000000000000000000000000001111010001100000011011
One's complement11111111110000101110011111100100at 32 bits, every bit flipped
Bits reversed11011000000110001011110000000000at 32 bits
Rotated left by 100000000011110100011000000110110at 32 bits, wrapping
Shifted left by 111110100011000000110110= 8,007,734, no wrap
Shifted right by 1111101000110000001101= 2,001,933, discarding the low bit
These bits as a double1.97817314 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,003,867 to the power 216,030,950,953,689
4,003,867 to the power 364,185,795,502,093,915,363
4,003,867 to the power 4256,991,388,479,582,258,622,708,721
4,003,867 to the power 51,028,959,339,617,579,579,084,928,898,624,107
First ten multiples4,003,867, 8,007,734, 12,011,601, 16,015,468, 20,019,335, 24,023,202, 28,027,069, 32,030,936, 36,034,803, 40,038,670
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 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7Yes
Divisible by 8No, remainder 3
Divisible by 9No, remainder 1
Divisible by 10No, remainder 7
Divisible by 11No, remainder 10
Divisible by 12No, remainder 7
Divisible by 100No, remainder 67
Collatz (3n + 1) trajectory
Steps to reach 1167the total stopping time
Highest value reached117,016,64829× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,003,867 → 12,011,602 → 6,005,801 → 18,017,404 → 9,008,702 → 4,504,351 → 13,513,054 → 6,756,527 → 20,269,582 → 10,134,791 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage400,386,700%
4,003,867% as a decimal40,038.67
4,003,867% of 1004,003,867
4,003,867% of 1,00040,038,670
As a fraction of 1004,003,867/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,867
Nerdulate something else
Nothing in mind? Surprise me · today’s page