Recognised as Number
4,189,687
- Positive
- Odd
- Composite
- 7 digits
4,189,687 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value4,189,687
Digit count7
Digit sum43
Digit product96,768
Multiplicative persistence5times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation463 × 9,049
Distinct prime factors2463, 9,049
Number of divisors4
Sum of divisors σ(n)4,199,200
Aliquot sum9,513sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)4,180,176integers below n that share no factor with it
Carmichael function λ(n)696,696the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 4,180,176
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 463, 9,049, 4,189,6874 in total
Arithmetic
Previous number4,189,686
Next number4,189,688
Double8,379,374
Half2,094,843.5
Square17,553,477,157,969
Cube73,543,575,053,539,665,703
Square root2,046.872492365≈irrational, shown to 9 decimal places
Cube root161.210698512≈
Negation-4,189,687
Reciprocal2.38681314 × 10^-7≈
Representations
Decimal4,189,687
Binary111111111011011111011122 bits
Octal17766767
Hexadecimal3FEDF7
Base 362HSS7
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, one hundred and eighty-nine thousand, six hundred and eighty-seven
Ordinalfour million, one hundred and eighty-nine thousand, six hundred and eighty-seventh
Scientific notation4.189687 × 10^6
Engineering notation4.189687 × 10^6
In other bases
Ternary21212212011121base 3; the most digit-efficient integer base after e: 14 digits
Quinary2033032222base 5; one hand: 10 digits
Septenary50416555base 7: 8 digits
Nonary7785147base 9; each digit is two ternary digits: 7 digits
Duodecimal14a0707base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal163e47base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal19:23:48:7base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T0T00TT1TTTT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10000000011001000001011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001111111110110111110111
Bit length22 bitsto write the magnitude
Set bits19the population count, or Hamming weight
Zero bits3within that length
Bit parityodd19 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
Bytes33f ed f7
Gray code1000000001101100001100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001111111110110111110111
64-bit0000000000000000000000000000000000000000001111111110110111110111
One's complement11111111110000000001001000001000at 32 bits, every bit flipped
Bits reversed11101111101101111111110000000000at 32 bits
Rotated left by 100000000011111111101101111101110at 32 bits, wrapping
Shifted left by 111111111101101111101110= 8,379,374, no wrap
Shifted right by 1111111111011011111011= 2,094,843, discarding the low bit
These bits as a double2.06998041 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,189,687 to the power 217,553,477,157,969
4,189,687 to the power 373,543,575,053,539,665,703
4,189,687 to the power 4308,124,560,335,339,441,380,204,961
4,189,687 to the power 51,290,945,464,817,687,298,137,906,782,437,207
First ten multiples4,189,687, 8,379,374, 12,569,061, 16,758,748, 20,948,435, 25,138,122, 29,327,809, 33,517,496, 37,707,183, 41,896,870
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 7No, remainder 5
Divisible by 8No, remainder 7
Divisible by 9No, remainder 7
Divisible by 10No, remainder 7
Divisible by 11No, remainder 7
Divisible by 12No, remainder 7
Divisible by 100No, remainder 87
Collatz (3n + 1) trajectory
Steps to reach 1136the total stopping time
Highest value reached28,280,3926× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,189,687 → 12,569,062 → 6,284,531 → 18,853,594 → 9,426,797 → 28,280,392 → 14,140,196 → 7,070,098 → 3,535,049 → 10,605,148 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage418,968,700%
4,189,687% as a decimal41,896.87
4,189,687% of 1004,189,687
4,189,687% of 1,00041,896,870
As a fraction of 1004,189,687/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,189,687
Nerdulate something else
Nothing in mind? Surprise me · today’s page