Recognised as Number
1,076,762
- Positive
- Even
- Composite
- 7 digits
1,076,762 is an even 7-digit integer and a composite number. It has 8 divisors and a digital root of 2.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,076,762
Digit count7
Digit sum29
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 factorisation2 × 103 × 5,227
Distinct prime factors32, 103, 5,227
Number of divisors8
Sum of divisors σ(n)1,631,136
Aliquot sum554,374sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)533,052integers below n that share no factor with it
Carmichael function λ(n)88,842the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 533,052
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 103, 206, 5,227, 10,454, 538,381, 1,076,7628 in total
Arithmetic
Previous number1,076,761
Next number1,076,763
Double2,153,524
Half538,381
Square1,159,416,404,644
Cube1,248,415,526,697,282,728
Square root1,037.67143162≈irrational, shown to 9 decimal places
Cube root102.495918933≈
Negation-1,076,762
Reciprocal9.28710337 × 10^-7≈
Representations
Decimal1,076,762
Binary10000011011100001101021 bits
Octal4067032
Hexadecimal106E1A
Base 36N2U2
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, seventy-six thousand, seven hundred and sixty-two
Ordinalone million, seventy-six thousand, seven hundred and sixty-second
Scientific notation1.076762 × 10^6
Engineering notation1.076762 × 10^6
In other bases
Ternary2000201001002base 3; the most digit-efficient integer base after e: 13 digits
Quinary233424022base 5; one hand: 9 digits
Septenary12103151base 7: 8 digits
Nonary2021032base 9; each digit is two ternary digits: 7 digits
Duodecimal43b162base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal6ebi2base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal4:59:6:2base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T001T0100101Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100011011001001101110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100000110111000011010
Bit length21 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits12within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes310 6e 1a
Gray code110000101100100010111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100000110111000011010
64-bit0000000000000000000000000000000000000000000100000110111000011010
One's complement11111111111011111001000111100101at 32 bits, every bit flipped
Bits reversed01011000011101100000100000000000at 32 bits
Rotated left by 100000000001000001101110000110100at 32 bits, wrapping
Shifted left by 11000001101110000110100= 2,153,524, no wrap
Shifted right by 110000011011100001101= 538,381, discarding the low bit
These bits as a double5.31991113 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,076,762 to the power 21,159,416,404,644
1,076,762 to the power 31,248,415,526,697,282,728
1,076,762 to the power 41,344,246,399,357,619,544,766,736
1,076,762 to the power 51,447,433,441,465,109,136,262,120,188,832
First ten multiples1,076,762, 2,153,524, 3,230,286, 4,307,048, 5,383,810, 6,460,572, 7,537,334, 8,614,096, 9,690,858, 10,767,620
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4No, remainder 2
Divisible by 5No, remainder 2
Divisible by 6No, remainder 2
Divisible by 7No, remainder 1
Divisible by 8No, remainder 2
Divisible by 9No, remainder 2
Divisible by 10No, remainder 2
Divisible by 11No, remainder 5
Divisible by 12No, remainder 2
Divisible by 100No, remainder 62
Collatz (3n + 1) trajectory
Steps to reach 1209the total stopping time
Highest value reached1,615,1441× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,076,762 → 538,381 → 1,615,144 → 807,572 → 403,786 → 201,893 → 605,680 → 302,840 → 151,420 → 75,710 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage107,676,200%
1,076,762% as a decimal10,767.62
1,076,762% of 1001,076,762
1,076,762% of 1,00010,767,620
As a fraction of 1001,076,762/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,076,762
Nerdulate something else
Nothing in mind? Surprise me · today’s page