Recognised as Number
4,128,689
- Positive
- Odd
- Prime
- 7 digits
4,128,689 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value4,128,689
Digit count7
Digit sum38
Digit product27,648
Multiplicative persistence7times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation4,128,689
Distinct prime factors14,128,689
Number of divisors2
Sum of divisors σ(n)4,128,690
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)4,128,688integers below n that share no factor with it
Carmichael function λ(n)4,128,688the 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,128,6892 in total
Arithmetic
Previous number4,128,688
Next number4,128,690
Double8,257,378
Half2,064,344.5
Square17,046,072,858,721
Cube70,377,933,504,999,946,769
Square root2,031.917567226≈irrational, shown to 9 decimal places
Cube root160.424510716≈
Negation-4,128,689
Reciprocal2.42207635 × 10^-7≈
Representations
Decimal4,128,689
Binary111110111111111011000122 bits
Octal17577661
Hexadecimal3EFFB1
Base 362GHPT
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, one hundred and twenty-eight thousand, six hundred and eighty-nine
Ordinalfour million, one hundred and twenty-eight thousand, six hundred and eighty-ninth
Scientific notation4.128689 × 10^6
Engineering notation4.128689 × 10^6
In other bases
Ternary21202202111102base 3; the most digit-efficient integer base after e: 14 digits
Quinary2024104224base 5; one hand: 10 digits
Septenary50043665base 7: 8 digits
Nonary7682442base 9; each digit is two ternary digits: 7 digits
Duodecimal1471355base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal15g1e9base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal19:6:51:29base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10TT10T1T11111Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10000110000000011110001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001111101111111110110001
Bit length22 bitsto write the magnitude
Set bits17the population count, or Hamming weight
Zero bits5within that length
Bit parityodd17 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
Bytes33e ff b1
Gray code1000011000000001101001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001111101111111110110001
64-bit0000000000000000000000000000000000000000001111101111111110110001
One's complement11111111110000010000000001001110at 32 bits, every bit flipped
Bits reversed10001101111111110111110000000000at 32 bits
Rotated left by 100000000011111011111111101100010at 32 bits, wrapping
Shifted left by 111111011111111101100010= 8,257,378, no wrap
Shifted right by 1111110111111111011000= 2,064,344, discarding the low bit
These bits as a double2.0398434 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,128,689 to the power 217,046,072,858,721
4,128,689 to the power 370,377,933,504,999,946,769
4,128,689 to the power 4290,568,599,904,824,725,225,755,841
4,128,689 to the power 51,199,667,382,172,450,889,967,600,657,422,449
First ten multiples4,128,689, 8,257,378, 12,386,067, 16,514,756, 20,643,445, 24,772,134, 28,900,823, 33,029,512, 37,158,201, 41,286,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 5
Divisible by 8No, remainder 1
Divisible by 9No, remainder 2
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 1198the total stopping time
Highest value reached12,386,0683× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,128,689 → 12,386,068 → 6,193,034 → 3,096,517 → 9,289,552 → 4,644,776 → 2,322,388 → 1,161,194 → 580,597 → 1,741,792 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage412,868,900%
4,128,689% as a decimal41,286.89
4,128,689% of 1004,128,689
4,128,689% of 1,00041,286,890
As a fraction of 1004,128,689/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,128,689
Nerdulate something else
Nothing in mind? Surprise me · today’s page