Recognised as Number
3,889,421
- Positive
- Odd
- Composite
- 7 digits
3,889,421 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,889,421
Digit count7
Digit sum35
Digit product13,824
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation61 × 63,761
Distinct prime factors261, 63,761
Number of divisors4
Sum of divisors σ(n)3,953,244
Aliquot sum63,823sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,825,600integers below n that share no factor with it
Carmichael function λ(n)191,280the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,825,600
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 61, 63,761, 3,889,4214 in total
Arithmetic
Previous number3,889,420
Next number3,889,422
Double7,778,842
Half1,944,710.5
Square15,127,595,715,241
Cube58,837,588,454,368,365,461
Square root1,972.161504543≈irrational, shown to 9 decimal places
Cube root157.263638076≈
Negation-3,889,421
Reciprocal2.57107677 × 10^-7≈
Representations
Decimal3,889,421
Binary111011010110010000110122 bits
Octal16654415
Hexadecimal3B590D
Base 362BD3H
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, eight hundred and eighty-nine thousand, four hundred and twenty-one
Ordinalthree million, eight hundred and eighty-nine thousand, four hundred and twenty-first
Scientific notation3.889421 × 10^6
Engineering notation3.889421 × 10^6
In other bases
Ternary21022121021122base 3; the most digit-efficient integer base after e: 14 digits
Quinary1443430141base 5; one hand: 10 digits
Septenary45026264base 7: 8 digits
Nonary7277248base 9; each digit is two ternary digits: 7 digits
Duodecimal13769a5base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1463b1base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal18:0:23:41base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1100TT110TT0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10011001010100100011101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001110110101100100001101
Bit length22 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits10within that length
Bit parityeven12 set bits, so even; 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
Bytes33b 59 0d
Gray code1001101111010110001011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001110110101100100001101
64-bit0000000000000000000000000000000000000000001110110101100100001101
One's complement11111111110001001010011011110010at 32 bits, every bit flipped
Bits reversed10110000100110101101110000000000at 32 bits
Rotated left by 100000000011101101011001000011010at 32 bits, wrapping
Shifted left by 111101101011001000011010= 7,778,842, no wrap
Shifted right by 1111011010110010000110= 1,944,710, discarding the low bit
These bits as a double1.9216293 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,889,421 to the power 215,127,595,715,241
3,889,421 to the power 358,837,588,454,368,365,461
3,889,421 to the power 4228,844,152,123,777,862,359,688,081
3,889,421 to the power 5890,071,250,997,416,217,196,880,375,691,101
First ten multiples3,889,421, 7,778,842, 11,668,263, 15,557,684, 19,447,105, 23,336,526, 27,225,947, 31,115,368, 35,004,789, 38,894,210
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 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 5
Divisible by 9No, remainder 8
Divisible by 10No, remainder 1
Divisible by 11No, remainder 8
Divisible by 12No, remainder 5
Divisible by 100No, remainder 21
Collatz (3n + 1) trajectory
Steps to reach 1185the total stopping time
Highest value reached11,668,2643× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,889,421 → 11,668,264 → 5,834,132 → 2,917,066 → 1,458,533 → 4,375,600 → 2,187,800 → 1,093,900 → 546,950 → 273,475 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage388,942,100%
3,889,421% as a decimal38,894.21
3,889,421% of 1003,889,421
3,889,421% of 1,00038,894,210
As a fraction of 1003,889,421/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 3,889,421
Nerdulate something else
Nothing in mind? Surprise me · today’s page