Recognised as Number
1,278,489
- Positive
- Odd
- Composite
- 7 digits
1,278,489 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,278,489
Digit count7
Digit sum39
Digit product32,256
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 426,163
Distinct prime factors23, 426,163
Number of divisors4
Sum of divisors σ(n)1,704,656
Aliquot sum426,167sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)852,324integers below n that share no factor with it
Carmichael function λ(n)426,162the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 852,324
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 426,163, 1,278,4894 in total
Arithmetic
Previous number1,278,488
Next number1,278,490
Double2,556,978
Half639,244.5
Square1,634,534,123,121
Cube2,089,733,896,534,844,169
Square root1,130.702878744≈irrational, shown to 9 decimal places
Cube root108.533964039≈
Negation-1,278,489
Reciprocal7.82173331 × 10^-7≈
Representations
Decimal1,278,489
Binary10011100000100001100121 bits
Octal4701031
Hexadecimal138219
Base 36REHL
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, two hundred and seventy-eight thousand, four hundred and eighty-nine
Ordinalone million, two hundred and seventy-eight thousand, four hundred and eighty-ninth
Scientific notation1.278489 × 10^6
Engineering notation1.278489 × 10^6
In other bases
Ternary2101221202110base 3; the most digit-efficient integer base after e: 13 digits
Quinary311402424base 5; one hand: 9 digits
Septenary13603242base 7: 8 digits
Nonary2357673base 9; each digit is two ternary digits: 7 digits
Duodecimal517a49base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal7jg49base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:55:8:9base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T11T00TT1T110digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101001000011001101001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100111000001000011001
Bit length21 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits13within that length
Bit parityeven8 set bits, so even; not the same as the number itself being odd
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes313 82 19
Gray code110100100001100010101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100111000001000011001
64-bit0000000000000000000000000000000000000000000100111000001000011001
One's complement11111111111011000111110111100110at 32 bits, every bit flipped
Bits reversed10011000010000011100100000000000at 32 bits
Rotated left by 100000000001001110000010000110010at 32 bits, wrapping
Shifted left by 11001110000010000110010= 2,556,978, no wrap
Shifted right by 110011100000100001100= 639,244, discarding the low bit
These bits as a double6.31657493 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,278,489 to the power 21,634,534,123,121
1,278,489 to the power 32,089,733,896,534,844,169
1,278,489 to the power 42,671,701,799,646,936,386,780,641
1,278,489 to the power 53,415,741,362,128,812,054,198,794,931,449
First ten multiples1,278,489, 2,556,978, 3,835,467, 5,113,956, 6,392,445, 7,670,934, 8,949,423, 10,227,912, 11,506,401, 12,784,890
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
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 2
Divisible by 8No, remainder 1
Divisible by 9No, remainder 3
Divisible by 10No, remainder 9
Divisible by 11No, remainder 3
Divisible by 12No, remainder 9
Divisible by 100No, remainder 89
Collatz (3n + 1) trajectory
Steps to reach 1173the total stopping time
Highest value reached4,314,9043× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,278,489 → 3,835,468 → 1,917,734 → 958,867 → 2,876,602 → 1,438,301 → 4,314,904 → 2,157,452 → 1,078,726 → 539,363 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage127,848,900%
1,278,489% as a decimal12,784.89
1,278,489% of 1001,278,489
1,278,489% of 1,00012,784,890
As a fraction of 1001,278,489/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 1,278,489
Nerdulate something else
Nothing in mind? Surprise me · today’s page