Recognised as Number
1,046,768
- Positive
- Even
- Composite
- 7 digits
1,046,768 is an even 7-digit integer and a composite number. It has 10 divisors and a digital root of 5.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,046,768
Digit count7
Digit sum32
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^4 × 65,423
Distinct prime factors22, 65,423
Number of divisors10
Sum of divisors σ(n)2,028,144
Aliquot sum981,376sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)523,376integers below n that share no factor with it
Carmichael function λ(n)130,844the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 523,376
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 16, 65,423, 130,846, 261,692, 523,384, 1,046,76810 in total
Arithmetic
Previous number1,046,767
Next number1,046,769
Double2,093,536
Half523,384
Square1,095,723,245,824
Cube1,146,968,030,584,696,832
Square root1,023.116806626≈irrational, shown to 9 decimal places
Cube root101.535243005≈
Negation-1,046,768
Reciprocal9.55321523 × 10^-7≈
Representations
Decimal1,046,768
Binary1111111110001111000020 bits
Octal3774360
HexadecimalFF8F0
Base 36MFOW
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, forty-six thousand, seven hundred and sixty-eight
Ordinalone million, forty-six thousand, seven hundred and sixty-eighth
Scientific notation1.046768 × 10^6
Engineering notation1.046768 × 10^6
In other bases
Ternary1222011220012base 3; the most digit-efficient integer base after e: 13 digits
Quinary231444033base 5; one hand: 9 digits
Septenary11616542base 7: 8 digits
Nonary1864805base 9; each digit is two ternary digits: 7 digits
Duodecimal425928base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal6agi8base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal4:50:46:8base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T00T1TT0T01TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100000000100100110000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000011111111100011110000
Bit length20 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits7within that length
Bit parityodd13 set bits, so odd; not the same as the number itself being even
Highest set bitbit 19worth 524,288
Lowest set bitbit 44 trailing zeros
Power of twoNo
Bytes30f f8 f0
Gray code10000000010010001000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000011111111100011110000
64-bit0000000000000000000000000000000000000000000011111111100011110000
One's complement11111111111100000000011100001111at 32 bits, every bit flipped
Bits reversed00001111000111111111000000000000at 32 bits
Rotated left by 100000000000111111111000111100000at 32 bits, wrapping
Shifted left by 1111111111000111100000= 2,093,536, no wrap
Shifted right by 11111111110001111000= 523,384, discarding the low bit
These bits as a double5.17172108 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,046,768 to the power 21,095,723,245,824
1,046,768 to the power 31,146,968,030,584,696,832
1,046,768 to the power 41,200,609,431,439,081,933,438,976
1,046,768 to the power 51,256,759,533,328,624,917,302,050,029,568
First ten multiples1,046,768, 2,093,536, 3,140,304, 4,187,072, 5,233,840, 6,280,608, 7,327,376, 8,374,144, 9,420,912, 10,467,680
Powers of twoBetween 2^19 (524,288) and 2^20 (1,048,576)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4Yes
Divisible by 5No, remainder 3
Divisible by 6No, remainder 2
Divisible by 7No, remainder 2
Divisible by 8Yes
Divisible by 9No, remainder 5
Divisible by 10No, remainder 8
Divisible by 11No, remainder 8
Divisible by 12No, remainder 8
Divisible by 100No, remainder 68
Collatz (3n + 1) trajectory
Steps to reach 1165the total stopping time
Highest value reached1,046,768
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,046,768 → 523,384 → 261,692 → 130,846 → 65,423 → 196,270 → 98,135 → 294,406 → 147,203 → 441,610 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage104,676,800%
1,046,768% as a decimal10,467.68
1,046,768% of 1001,046,768
1,046,768% of 1,00010,467,680
As a fraction of 1001,046,768/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,046,768
Nerdulate something else
Nothing in mind? Surprise me · today’s page