Recognised as Number
4,078,689
- Positive
- Odd
- Composite
- 7 digits
4,078,689 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value4,078,689
Digit count7
Digit sum42
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 1,359,563
Distinct prime factors23, 1,359,563
Number of divisors4
Sum of divisors σ(n)5,438,256
Aliquot sum1,359,567sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,719,124integers below n that share no factor with it
Carmichael function λ(n)1,359,562the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,719,124
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 1,359,563, 4,078,6894 in total
Arithmetic
Previous number4,078,688
Next number4,078,690
Double8,157,378
Half2,039,344.5
Square16,635,703,958,721
Cube67,851,862,743,691,796,769
Square root2,019.576440742≈irrational, shown to 9 decimal places
Cube root159.774278064≈
Negation-4,078,689
Reciprocal2.4517682 × 10^-7≈
Representations
Decimal4,078,689
Binary111110001111000110000122 bits
Octal17436141
Hexadecimal3E3C61
Base 362FF4X
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour million, seventy-eight thousand, six hundred and eighty-nine
Ordinalfour million, seventy-eight thousand, six hundred and eighty-ninth
Scientific notation4.078689 × 10^6
Engineering notation4.078689 × 10^6
In other bases
Ternary21200012220120base 3; the most digit-efficient integer base after e: 14 digits
Quinary2021004224base 5; one hand: 10 digits
Septenary46445136base 7: 8 digits
Nonary7605816base 9; each digit is two ternary digits: 7 digits
Duodecimal1448429base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal159ge9base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal18:52:58:9base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10TT001T00T1TT0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10000100100110110100001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001111100011110001100001
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
Bytes33e 3c 61
Gray code1000010010001001010001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001111100011110001100001
64-bit0000000000000000000000000000000000000000001111100011110001100001
One's complement11111111110000011100001110011110at 32 bits, every bit flipped
Bits reversed10000110001111000111110000000000at 32 bits
Rotated left by 100000000011111000111100011000010at 32 bits, wrapping
Shifted left by 111111000111100011000010= 8,157,378, no wrap
Shifted right by 1111110001111000110000= 2,039,344, discarding the low bit
These bits as a double2.01514011 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
4,078,689 to the power 216,635,703,958,721
4,078,689 to the power 367,851,862,743,691,796,769
4,078,689 to the power 4276,746,646,202,205,550,871,955,841
4,078,689 to the power 51,128,763,501,651,827,556,080,386,697,172,449
First ten multiples4,078,689, 8,157,378, 12,236,067, 16,314,756, 20,393,445, 24,472,134, 28,550,823, 32,629,512, 36,708,201, 40,786,890
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 3
Divisible by 7No, remainder 6
Divisible by 8No, remainder 1
Divisible by 9No, remainder 6
Divisible by 10No, remainder 9
Divisible by 11No, remainder 10
Divisible by 12No, remainder 9
Divisible by 100No, remainder 89
Collatz (3n + 1) trajectory
Steps to reach 1110the total stopping time
Highest value reached33,074,7288× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,078,689 → 12,236,068 → 6,118,034 → 3,059,017 → 9,177,052 → 4,588,526 → 2,294,263 → 6,882,790 → 3,441,395 → 10,324,186 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage407,868,900%
4,078,689% as a decimal40,786.89
4,078,689% of 1004,078,689
4,078,689% of 1,00040,786,890
As a fraction of 1004,078,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,078,689
Nerdulate something else
Nothing in mind? Surprise me · today’s page