Recognised as Number
676,767,000,000
- Positive
- Even
- Composite
- 12 digits
676,767,000,000 is an even 12-digit integer and a composite number. It has 1,568 divisors and a digital root of 3.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value676,767,000,000
Digit count12
Digit sum39
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 numberYesdivisible by its own digit sum
Factors & divisors
Prime factorisation2^6 × 3 × 5^6 × 7 × 13 × 37 × 67
Distinct prime factors72, 3, 5, 7, 13, 37, 67
Number of divisors1,568
Sum of divisors σ(n)2,871,433,245,184
Aliquot sum2,194,666,245,184sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)136,857,600,000integers below n that share no factor with it
Carmichael function λ(n)4,950,000the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 136,857,600,000
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1,568 divisors, too many to listlisting is capped at 512
Arithmetic
Previous number676,766,999,999
Next number676,767,000,001
Double1,353,534,000,000
Half338,383,500,000
Square458,013,572,289,000,000,000,000
Cube309,968,471,277,309,663,000,000,000,000,000,000
Square root822,658.495367306≈irrational, shown to 9 decimal places
Cube root8,779.700973795≈
Negation-676,767,000,000
Reciprocal1.47761342 × 10^-12≈
Representations
Decimal676,767,000,000
Binary100111011001001001110100111001011100000040 bits
Octal11662235162700
Hexadecimal9D9274E5C0
Base 368MWHLJ9C
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssix hundred and seventy-six billion, seven hundred and sixty-seven million
Ordinalsix hundred and seventy-six billion, seven hundred and sixty-seven millionth
Scientific notation6.76767 × 10^11
Engineering notation676.767 × 10^9
In other bases
Ternary2101200212001111201020110base 3; the most digit-efficient integer base after e: 25 digits
Quinary42042004323000000base 5; one hand: 17 digits
Septenary66615626404440base 7: 14 digits
Nonary2350761451213base 9; each digit is two ternary digits: 13 digits
Duodecimalab1b3a95540base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 11 digits
Vigesimal168e9df000base 20; hands and feet, and the Mayan and Yoruba systems: 10 digits
Sexagesimal14:30:19:40:33:20:0base 60; Babylonian, and still how an hour and a circle are divided: 7 digits
Balanced ternary1T11TT010TT01TTTTT011T0110digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11110001010010111101101010011101011000000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0000000000000000000000001001110110010010011101001110010111000000
Bit length40 bitsto write the magnitude
Set bits19the population count, or Hamming weight
Zero bits21within that length
Bit parityodd19 set bits, so odd; not the same as the number itself being even
Highest set bitbit 39worth 549,755,813,888
Lowest set bitbit 66 trailing zeros
Power of twoNo
Bytes59d 92 74 e5 c0
Gray code1101001101011011010011101001011100100000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit0000000000000000000000001001110110010010011101001110010111000000
One's complement1111111111111111111111110110001001101101100010110001101000111111at 64 bits, every bit flipped
Bits reversed0000001110100111001011100100100110111001000000000000000000000000at 64 bits
Rotated left by 10000000000000000000000010011101100100100111010011100101110000000at 64 bits, wrapping
Shifted left by 110011101100100100111010011100101110000000= 1,353,534,000,000, no wrap
Shifted right by 1100111011001001001110100111001011100000= 338,383,500,000, discarding the low bit
These bits as a double3.34367325 × 10^-312≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
676,767,000,000 to the power 2458,013,572,289,000,000,000,000
676,767,000,000 to the power 3309,968,471,277,309,663,000,000,000,000,000,000
676,767,000,000 to the power 4209776432400931028699521000000… (48 digits)
676,767,000,000 to the power 5141969766826680889499888728607… (60 digits)
First ten multiples676,767,000,000, 1,353,534,000,000, 2,030,301,000,000, 2,707,068,000,000, 3,383,835,000,000, 4,060,602,000,000, 4,737,369,000,000, 5,414,136,000,000, 6,090,903,000,000, 6,767,670,000,000
Powers of twoBetween 2^39 (549,755,813,888) and 2^40 (1,099,511,627,776)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4Yes
Divisible by 5Yes
Divisible by 6Yes
Divisible by 7Yes
Divisible by 8Yes
Divisible by 9No, remainder 3
Divisible by 10Yes
Divisible by 11No, remainder 3
Divisible by 12Yes
Divisible by 100Yes
Collatz (3n + 1) trajectory
Steps to reach 1373the total stopping time
Highest value reached676,767,000,000
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps676,767,000,000 → 338,383,500,000 → 169,191,750,000 → 84,595,875,000 → 42,297,937,500 → 21,148,968,750 → 10,574,484,375 → 31,723,453,126 → 15,861,726,563 → 47,585,179,690 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage67,676,700,000,000%
676,767,000,000% as a decimal6,767,670,000
676,767,000,000% of 100676,767,000,000
676,767,000,000% of 1,0006,767,670,000,000
As a fraction of 100676,767,000,000/100
Read another way
As seconds21,445 years, 165 days and 3 hours
As bytes630.288 GiB
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from 676,767,000,000
Nearby primes
Also reads as
676767000000 (identifier)
- 12 characters
- Checksum valid
676767000000 matches the shape of Luhn (cards, IMEI), GTIN-12 (UPC-A). The check digit is valid for Luhn (cards, IMEI). A valid check digit only means the number is well-formed; it cannot tell you the thing it identifies exists.
Checksum tests
Luhn (cards, IMEI)Check digit validmod 10 with every second digit doubled
GTIN-12 (UPC-A)Check digit does not matchGS1 mod 10, weights 3 and 1 alternating from the right
What this does not tell you
ExistenceNot checkedno network lookup is made, ever
Ownership or validity in useNot checked
Nerdulate something else
Nothing in mind? Surprise me · today’s page