Recognised as Number
807,794,703,076
- Positive
- Even
- Composite
- Perfect square
- 12 digits
807,794,703,076 is an even 12-digit integer and a composite number. It has 81 divisors and a digital root of 4.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value807,794,703,076
Digit count12
Digit sum58
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Perfect squareYes, 898,774²
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^2 × 53^2 × 61^2 × 139^2
Distinct prime factors42, 53, 61, 139
Number of divisors81
Sum of divisors σ(n)1,475,437,719,483
Aliquot sum667,643,016,407sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)386,976,133,440integers below n that share no factor with it
Carmichael function λ(n)8,062,002,780the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 386,976,133,440
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 53, 61, 106, 122, 139, 212, 244, 278, 556, 2,809, 3,233, 3,721, 5,618, 6,466, 7,367, 7,442, 8,479, 11,236, 12,932, 14,734, 14,884, 16,958, 19,321, 29,468, 33,916, 38,642, 77,284, 171,349, 197,213, 342,698, 390,451, 394,426, 449,387, 517,219, 685,396, 780,902, 788,852, 898,774, 1,024,013, 1,034,438, 1,178,581, 1,561,804, 1,797,548, 2,048,026, 2,068,876, 2,357,162, 4,096,052, 4,714,324, 10,452,289, 20,904,578, 23,817,511, 27,412,607, 41,809,156, 47,635,022, 54,272,689, 54,825,214, 62,464,793, 71,893,441, 95,270,044, 108,545,378, 109,650,428, 124,929,586, 143,786,882, 217,090,756, 249,859,172, 287,573,764, 1,452,868,171, 2,905,736,342, 3,310,634,029, 3,810,352,373, 5,811,472,684, 6,621,268,058, 7,620,704,746, 13,242,536,116, 15,241,409,492, 201,948,675,769, 403,897,351,538, 807,794,703,07681 in total
Arithmetic
Previous number807,794,703,075
Next number807,794,703,077
Double1,615,589,406,152
Half403,897,351,538
Square652,532,282,317,643,003,861,776
Cube527,112,121,242,285,035,420,692,065,266,022,976
Square root898,774exact
Cube root9,313.230112381≈
Negation-807,794,703,076
Reciprocal1.2379383 × 10^-12≈
Representations
Decimal807,794,703,076
Binary101111000001010001010000111110101110010040 bits
Octal13602424175344
HexadecimalBC1450FAE4
Base 36AB3G3Y04
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordseight hundred and seven billion, seven hundred and ninety-four million, seven hundred and three thousand and seventy-six
Ordinaleight hundred and seven billion, seven hundred and ninety-four million, seven hundred and three thousand and seventy-sixth
Scientific notation8.07794703 × 10^11
Engineering notation807.794703 × 10^9
In other bases
Ternary2212020001121020200110011base 3; the most digit-efficient integer base after e: 25 digits
Quinary101213330420444301base 5; one hand: 18 digits
Septenary112234622453614base 7: 15 digits
Nonary2766047220404base 9; each digit is two ternary digits: 13 digits
Duodecimal11068098a604base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 12 digits
Vigesimal1bb1fghhdgbase 20; hands and feet, and the Mayan and Yoruba systems: 10 digits
Sexagesimal17:18:49:50:17:31:16base 60; Babylonian, and still how an hour and a circle are divided: 7 digits
Balanced ternary100TT1T001TTT11T1T00110011digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11100110000010100010100010000111100100100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0000000000000000000000001011110000010100010100001111101011100100
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 22 trailing zeros
Power of twoNo
Bytes5bc 14 50 fa e4
Gray code1110001000011110011110001000011110010110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit0000000000000000000000001011110000010100010100001111101011100100
One's complement1111111111111111111111110100001111101011101011110000010100011011at 64 bits, every bit flipped
Bits reversed0010011101011111000010100010100000111101000000000000000000000000at 64 bits
Rotated left by 10000000000000000000000010111100000101000101000011111010111001000at 64 bits, wrapping
Shifted left by 110111100000101000101000011111010111001000= 1,615,589,406,152, no wrap
Shifted right by 1101111000001010001010000111110101110010= 403,897,351,538, discarding the low bit
These bits as a double3.99103612 × 10^-312≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
807,794,703,076 to the power 2652,532,282,317,643,003,861,776
807,794,703,076 to the power 3527,112,121,242,285,035,420,692,065,266,022,976
807,794,703,076 to the power 4425798379466672152443416089607… (48 digits)
807,794,703,076 to the power 5343957675511522406620867107996… (60 digits)
First ten multiples807,794,703,076, 1,615,589,406,152, 2,423,384,109,228, 3,231,178,812,304, 4,038,973,515,380, 4,846,768,218,456, 5,654,562,921,532, 6,462,357,624,608, 7,270,152,327,684, 8,077,947,030,760
Powers of twoBetween 2^39 (549,755,813,888) and 2^40 (1,099,511,627,776)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4Yes
Divisible by 5No, remainder 1
Divisible by 6No, remainder 4
Divisible by 7No, remainder 4
Divisible by 8No, remainder 4
Divisible by 9No, remainder 4
Divisible by 10No, remainder 6
Divisible by 11No, remainder 9
Divisible by 12No, remainder 4
Divisible by 100No, remainder 76
Collatz (3n + 1) trajectory
Steps to reach 1231the total stopping time
Highest value reached807,794,703,076
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps807,794,703,076 → 403,897,351,538 → 201,948,675,769 → 605,846,027,308 → 302,923,013,654 → 151,461,506,827 → 454,384,520,482 → 227,192,260,241 → 681,576,780,724 → 340,788,390,362 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage80,779,470,307,600%
807,794,703,076% as a decimal8,077,947,030.76
807,794,703,076% of 100807,794,703,076
807,794,703,076% of 1,0008,077,947,030,760
As a fraction of 100807,794,703,076/100
Read another way
As seconds25,597 years, 171 days and 11 hours
As bytes752.317 GiB
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from 807,794,703,076
Nearby primes
Also reads as
807794703076 (identifier)
- 12 characters
- Checksum valid
807794703076 matches the shape of Luhn (cards, IMEI), GTIN-12 (UPC-A). The check digit is valid for GTIN-12 (UPC-A). 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 validGS1 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