Recognised as Number
684,688,396,681
- Positive
- Odd
- Composite
- Perfect square
- 12 digits
684,688,396,681 is an odd 12-digit integer and a composite number. It has 9 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value684,688,396,681
Digit count12
Digit sum73
Digit product573,308,928
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Perfect squareYes, 827,459²
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation173^2 × 4,783^2
Distinct prime factors2173, 4,783
Number of divisors9
Sum of divisors σ(n)688,813,022,919
Aliquot sum4,124,626,238sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)680,588,337,336integers below n that share no factor with it
Carmichael function λ(n)340,294,168,668the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 680,588,337,336
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 173, 4,783, 29,929, 827,459, 22,877,089, 143,150,407, 3,957,736,397, 684,688,396,6819 in total
Arithmetic
Previous number684,688,396,680
Next number684,688,396,682
Double1,369,376,793,362
Square468,798,200,549,598,411,815,761
Cube320,980,688,301,242,429,604,557,365,055,889,241
Square root827,459exact
Cube root8,813.82295834≈
Negation-684,688,396,681
Reciprocal1.4605184 × 10^-12≈
Representations
Decimal684,688,396,681
Binary100111110110101010011011110100011000100140 bits
Octal11755246750611
Hexadecimal9F6A9BD189
Base 368QJHSK21
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssix hundred and eighty-four billion, six hundred and eighty-eight million, three hundred and ninety-six thousand, six hundred and eighty-one
Ordinalsix hundred and eighty-four billion, six hundred and eighty-eight million, three hundred and ninety-six thousand, six hundred and eighty-first
Scientific notation6.84688397 × 10^11
Engineering notation684.688397 × 10^9
In other bases
Ternary2102110022010000100122201base 3; the most digit-efficient integer base after e: 25 digits
Quinary42204220212143211base 5; one hand: 17 digits
Septenary100316134226422base 7: 15 digits
Nonary2373263010581base 9; each digit is two ternary digits: 13 digits
Duodecimalb0844913061base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 11 digits
Vigesimal16ei529be1base 20; hands and feet, and the Mayan and Yoruba systems: 10 digits
Sexagesimal14:40:30:53:41:18:1base 60; Babylonian, and still how an hour and a circle are divided: 7 digits
Balanced ternary1T11T11010T010000101T00T01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11110000010111111111011001101011010011001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0000000000000000000000001001111101101010100110111101000110001001
Bit length40 bitsto write the magnitude
Set bits22the population count, or Hamming weight
Zero bits18within that length
Bit parityeven22 set bits, so even; not the same as the number itself being odd
Highest set bitbit 39worth 549,755,813,888
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes59f 6a 9b d1 89
Gray code1101000011011111110101100011100101001101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit0000000000000000000000001001111101101010100110111101000110001001
One's complement1111111111111111111111110110000010010101011001000010111001110110at 64 bits, every bit flipped
Bits reversed1001000110001011110110010101011011111001000000000000000000000000at 64 bits
Rotated left by 10000000000000000000000010011111011010101001101111010001100010010at 64 bits, wrapping
Shifted left by 110011111011010101001101111010001100010010= 1,369,376,793,362, no wrap
Shifted right by 1100111110110101010011011110100011000100= 342,344,198,340, discarding the low bit
These bits as a double3.38281015 × 10^-312≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
684,688,396,681 to the power 2468,798,200,549,598,411,815,761
684,688,396,681 to the power 3320,980,688,301,242,429,604,557,365,055,889,241
684,688,396,681 to the power 4219771752838541492666233391130… (48 digits)
684,688,396,681 to the power 5150475169086793985276135860440… (60 digits)
First ten multiples684,688,396,681, 1,369,376,793,362, 2,054,065,190,043, 2,738,753,586,724, 3,423,441,983,405, 4,108,130,380,086, 4,792,818,776,767, 5,477,507,173,448, 6,162,195,570,129, 6,846,883,966,810
Powers of twoBetween 2^39 (549,755,813,888) and 2^40 (1,099,511,627,776)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 2
Divisible by 8No, remainder 1
Divisible by 9No, remainder 1
Divisible by 10No, remainder 1
Divisible by 11No, remainder 3
Divisible by 12No, remainder 1
Divisible by 100No, remainder 81
Collatz (3n + 1) trajectory
Steps to reach 1267the total stopping time
Highest value reached3,899,514,384,2325× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps684,688,396,681 → 2,054,065,190,044 → 1,027,032,595,022 → 513,516,297,511 → 1,540,548,892,534 → 770,274,446,267 → 2,310,823,338,802 → 1,155,411,669,401 → 3,466,235,008,204 → 1,733,117,504,102 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage68,468,839,668,100%
684,688,396,681% as a decimal6,846,883,966.81
684,688,396,681% of 100684,688,396,681
684,688,396,681% of 1,0006,846,883,966,810
As a fraction of 100684,688,396,681/100
Read another way
As seconds21,696 years, 170 days and 5 hours
As bytes637.666 GiB
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from 684,688,396,681
Nearby primes
Also reads as
684688396681 (identifier)
- 12 characters
- Checksum fails
684688396681 matches the shape of Luhn (cards, IMEI), GTIN-12 (UPC-A). No check digit validates. 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 does not matchmod 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