Recognised as Number
599,127,085,089
- Positive
- Odd
- Composite
- Perfect square
- 12 digits
599,127,085,089 is an odd 12-digit integer and a composite number. It has 81 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value599,127,085,089
Digit count12
Digit sum63
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Perfect squareYes, 774,033²
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3^2 × 13^2 × 89^2 × 223^2
Distinct prime factors43, 13, 89, 223
Number of divisors81
Sum of divisors σ(n)952,012,716,057
Aliquot sum352,885,630,968sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)362,916,208,512integers below n that share no factor with it
Carmichael function λ(n)2,520,251,448the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 362,916,208,512
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 13, 39, 89, 117, 169, 223, 267, 507, 669, 801, 1,157, 1,521, 2,007, 2,899, 3,471, 7,921, 8,697, 10,413, 15,041, 19,847, 23,763, 26,091, 37,687, 45,123, 49,729, 59,541, 71,289, 102,973, 113,061, 135,369, 149,187, 178,623, 258,011, 308,919, 339,183, 447,561, 646,477, 774,033, 926,757, 1,338,649, 1,766,383, 1,939,431, 2,322,099, 3,354,143, 4,015,947, 4,425,881, 5,299,149, 5,818,293, 8,404,201, 10,062,429, 12,047,841, 13,277,643, 15,897,447, 22,962,979, 25,212,603, 30,187,287, 39,832,929, 57,536,453, 68,888,937, 75,637,809, 172,609,359, 206,666,811, 298,518,727, 393,903,409, 517,828,077, 747,973,889, 895,556,181, 1,181,710,227, 2,243,921,667, 2,686,668,543, 3,545,130,681, 5,120,744,317, 6,731,765,001, 15,362,232,951, 46,086,698,853, 66,569,676,121, 199,709,028,363, 599,127,085,08981 in total
Arithmetic
Previous number599,127,085,088
Next number599,127,085,090
Double1,198,254,170,178
Square358,953,264,087,241,846,137,921
Cube215,058,622,795,771,233,470,395,640,996,559,969
Square root774,033exact
Cube root8,430.234418113≈
Negation-599,127,085,089
Reciprocal1.66909496 × 10^-12≈
Representations
Decimal599,127,085,089
Binary100010110111111011000001110100000010000140 bits
Octal10557660350041
Hexadecimal8B7EC1D021
Base 367N8GSPI9
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfive hundred and ninety-nine billion, one hundred and twenty-seven million, eighty-five thousand and eighty-nine
Ordinalfive hundred and ninety-nine billion, one hundred and twenty-seven million, eighty-five thousand and eighty-ninth
Scientific notation5.99127085 × 10^11
Engineering notation599.127085 × 10^9
In other bases
Ternary2010021110012022101100100base 3; the most digit-efficient integer base after e: 25 digits
Quinary34304003013210324base 5; one hand: 17 digits
Septenary61166633124411base 7: 14 digits
Nonary2107405271310base 9; each digit is two ternary digits: 13 digits
Duodecimal98146547169base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 11 digits
Vigesimal1381745ce9base 20; hands and feet, and the Mayan and Yoruba systems: 10 digits
Sexagesimal12:50:28:56:30:18:9base 60; Babylonian, and still how an hour and a circle are divided: 7 digits
Balanced ternary1T0101T11101TT10T101100100digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001110010000011110001101101000001100001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0000000000000000000000001000101101111110110000011101000000100001
Bit length40 bitsto write the magnitude
Set bits18the population count, or Hamming weight
Zero bits22within that length
Bit parityeven18 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
Bytes58b 7e c1 d0 21
Gray code1100111011000001101000010011100000110001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit0000000000000000000000001000101101111110110000011101000000100001
One's complement1111111111111111111111110111010010000001001111100010111111011110at 64 bits, every bit flipped
Bits reversed1000010000001011100000110111111011010001000000000000000000000000at 64 bits
Rotated left by 10000000000000000000000010001011011111101100000111010000001000010at 64 bits, wrapping
Shifted left by 110001011011111101100000111010000001000010= 1,198,254,170,178, no wrap
Shifted right by 1100010110111111011000001110100000010000= 299,563,542,544, discarding the low bit
These bits as a double2.9600811 × 10^-312≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
599,127,085,089 to the power 2358,953,264,087,241,846,137,921
599,127,085,089 to the power 3215,058,622,795,771,233,470,395,640,996,559,969
599,127,085,089 to the power 4128847445798885186864796213965… (48 digits)
599,127,085,089 to the power 5771959946226490009320864264233… (59 digits)
First ten multiples599,127,085,089, 1,198,254,170,178, 1,797,381,255,267, 2,396,508,340,356, 2,995,635,425,445, 3,594,762,510,534, 4,193,889,595,623, 4,793,016,680,712, 5,392,143,765,801, 5,991,270,850,890
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 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 3
Divisible by 7No, remainder 1
Divisible by 8No, remainder 1
Divisible by 9Yes
Divisible by 10No, remainder 9
Divisible by 11No, remainder 5
Divisible by 12No, remainder 9
Divisible by 100No, remainder 89
Collatz (3n + 1) trajectory
Steps to reach 1378the total stopping time
Highest value reached1,797,381,255,2683× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps599,127,085,089 → 1,797,381,255,268 → 898,690,627,634 → 449,345,313,817 → 1,348,035,941,452 → 674,017,970,726 → 337,008,985,363 → 1,011,026,956,090 → 505,513,478,045 → 1,516,540,434,136 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage59,912,708,508,900%
599,127,085,089% as a decimal5,991,270,850.89
599,127,085,089% of 100599,127,085,089
599,127,085,089% of 1,0005,991,270,850,890
As a fraction of 100599,127,085,089/100
Read another way
As seconds18,985 years, 70 days and 18 minutes
As bytes557.981 GiB
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from 599,127,085,089
Nearby primes
Also reads as
599127085089 (identifier)
- 12 characters
- Checksum fails
599127085089 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