Recognised as Number
587,425,674,969
- Positive
- Odd
- Composite
- Perfect square
- 12 digits
587,425,674,969 is an odd 12-digit integer and a composite number. It has 27 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value587,425,674,969
Digit count12
Digit sum72
Digit product914,457,600
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Perfect squareYes, 766,437²
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3^2 × 7^2 × 36,497^2
Distinct prime factors33, 7, 36,497
Number of divisors27
Sum of divisors σ(n)987,062,022,687
Aliquot sum399,636,347,718sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)335,662,617,024integers below n that share no factor with it
Carmichael function λ(n)27,971,884,752the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 335,662,617,024
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 7, 9, 21, 49, 63, 147, 441, 36,497, 109,491, 255,479, 328,473, 766,437, 1,788,353, 2,299,311, 5,365,059, 16,095,177, 1,332,031,009, 3,996,093,027, 9,324,217,063, 11,988,279,081, 27,972,651,189, 65,269,519,441, 83,917,953,567, 195,808,558,323, 587,425,674,96927 in total
Arithmetic
Previous number587,425,674,968
Next number587,425,674,970
Double1,174,851,349,938
Square345,068,923,612,785,233,150,961
Cube202,702,345,364,066,667,581,739,300,095,995,209
Square root766,437exact
Cube root8,374.990212955≈
Negation-587,425,674,969
Reciprocal1.70234302 × 10^-12≈
Representations
Decimal587,425,674,969
Binary100010001100010101001100011101101101100140 bits
Octal10430523073331
Hexadecimal88C54C76D9
Base 367HUY2VO9
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfive hundred and eighty-seven billion, four hundred and twenty-five million, six hundred and seventy-four thousand, nine hundred and sixty-nine
Ordinalfive hundred and eighty-seven billion, four hundred and twenty-five million, six hundred and seventy-four thousand, nine hundred and sixty-ninth
Scientific notation5.87425675 × 10^11
Engineering notation587.425675 × 10^9
In other bases
Ternary2002011020201001011022100base 3; the most digit-efficient integer base after e: 25 digits
Quinary34111021433044334base 5; one hand: 17 digits
Septenary60303645565200base 7: 14 digits
Nonary2064221034270base 9; each digit is two ternary digits: 13 digits
Duodecimal95a1b805909base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 11 digits
Vigesimal12iiaa9789base 20; hands and feet, and the Mayan and Yoruba systems: 10 digits
Sexagesimal12:35:26:3:18:36:9base 60; Babylonian, and still how an hour and a circle are divided: 7 digits
Balanced ternary1T01T0111T1T0100101110T100digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001100111000101010111011000101100101001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0000000000000000000000001000100011000101010011000111011011011001
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 odd
Highest set bitbit 39worth 549,755,813,888
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes588 c5 4c 76 d9
Gray code1100110010100111111010100100110110110101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit0000000000000000000000001000100011000101010011000111011011011001
One's complement1111111111111111111111110111011100111010101100111000100100100110at 64 bits, every bit flipped
Bits reversed1001101101101110001100101010001100010001000000000000000000000000at 64 bits
Rotated left by 10000000000000000000000010001000110001010100110001110110110110010at 64 bits, wrapping
Shifted left by 110001000110001010100110001110110110110010= 1,174,851,349,938, no wrap
Shifted right by 1100010001100010101001100011101101101100= 293,712,837,484, discarding the low bit
These bits as a double2.90226845 × 10^-312≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
587,425,674,969 to the power 2345,068,923,612,785,233,150,961
587,425,674,969 to the power 3202,702,345,364,066,667,581,739,300,095,995,209
587,425,674,969 to the power 4119072562043286210242917759337… (48 digits)
587,425,674,969 to the power 5699462801285655318467960062310… (59 digits)
First ten multiples587,425,674,969, 1,174,851,349,938, 1,762,277,024,907, 2,349,702,699,876, 2,937,128,374,845, 3,524,554,049,814, 4,111,979,724,783, 4,699,405,399,752, 5,286,831,074,721, 5,874,256,749,690
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 7Yes
Divisible by 8No, remainder 1
Divisible by 9Yes
Divisible by 10No, remainder 9
Divisible by 11No, remainder 1
Divisible by 12No, remainder 9
Divisible by 100No, remainder 69
Collatz (3n + 1) trajectory
Steps to reach 1440the total stopping time
Highest value reached3,014,415,399,9765× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps587,425,674,969 → 1,762,277,024,908 → 881,138,512,454 → 440,569,256,227 → 1,321,707,768,682 → 660,853,884,341 → 1,982,561,653,024 → 991,280,826,512 → 495,640,413,256 → 247,820,206,628 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage58,742,567,496,900%
587,425,674,969% as a decimal5,874,256,749.69
587,425,674,969% of 100587,425,674,969
587,425,674,969% of 1,0005,874,256,749,690
As a fraction of 100587,425,674,969/100
Read another way
As seconds18,614 years, 144 days and 18 hours
As bytes547.083 GiB
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from 587,425,674,969
Nearby primes
Also reads as
587425674969 (identifier)
- 12 characters
- Checksum fails
587425674969 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