Recognised as Number
594,747,897,601
- Positive
- Odd
- Composite
- Perfect square
- 12 digits
594,747,897,601 is an odd 12-digit integer and a composite number. It has 27 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value594,747,897,601
Digit count12
Digit sum67
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, 771,199²
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation11^2 × 13^2 × 5,393^2
Distinct prime factors311, 13, 5,393
Number of divisors27
Sum of divisors σ(n)708,017,688,777
Aliquot sum113,269,791,176sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)498,996,600,960integers below n that share no factor with it
Carmichael function λ(n)62,374,575,120the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 498,996,600,960
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 11, 13, 121, 143, 169, 1,573, 1,859, 5,393, 20,449, 59,323, 70,109, 652,553, 771,199, 911,417, 8,483,189, 10,025,587, 29,084,449, 110,281,457, 319,928,939, 378,097,837, 3,519,218,329, 4,159,076,207, 4,915,271,881, 45,749,838,277, 54,067,990,691, 594,747,897,60127 in total
Arithmetic
Previous number594,747,897,600
Next number594,747,897,602
Double1,189,495,795,202
Square353,725,061,700,809,581,555,201
Cube210,377,236,775,340,503,909,592,342,676,972,801
Square root771,199exact
Cube root8,409.644523242≈
Negation-594,747,897,601
Reciprocal1.68138467 × 10^-12≈
Representations
Decimal594,747,897,601
Binary100010100111100110111100101101110000000140 bits
Octal10517157133401
Hexadecimal8A79BCB701
Base 367L81JITD
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfive hundred and ninety-four billion, seven hundred and forty-seven million, eight hundred and ninety-seven thousand, six hundred and one
Ordinalfive hundred and ninety-four billion, seven hundred and forty-seven million, eight hundred and ninety-seven thousand, six hundred and first
Scientific notation5.94747898 × 10^11
Engineering notation594.747898 × 10^9
In other bases
Ternary2002212011000002121110011base 3; the most digit-efficient integer base after e: 25 digits
Quinary34221020430210401base 5; one hand: 17 digits
Septenary60653256501064base 7: 14 digits
Nonary2085130077404base 9; each digit is two ternary digits: 13 digits
Duodecimal97323a4b141base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 11 digits
Vigesimal134cie7401base 20; hands and feet, and the Mayan and Yoruba systems: 10 digits
Sexagesimal12:44:51:2:29:20:1base 60; Babylonian, and still how an hour and a circle are divided: 7 digits
Balanced ternary1T0100TT011000010TT1110011digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001111110001110110011011100101100000001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0000000000000000000000001000101001111001101111001011011100000001
Bit length40 bitsto write the magnitude
Set bits20the population count, or Hamming weight
Zero bits20within that length
Bit parityeven20 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
Bytes58a 79 bc b7 01
Gray code1100111101000101011000101110110010000001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit0000000000000000000000001000101001111001101111001011011100000001
One's complement1111111111111111111111110111010110000110010000110100100011111110at 64 bits, every bit flipped
Bits reversed1000000011101101001111011001111001010001000000000000000000000000at 64 bits
Rotated left by 10000000000000000000000010001010011110011011110010110111000000010at 64 bits, wrapping
Shifted left by 110001010011110011011110010110111000000010= 1,189,495,795,202, no wrap
Shifted right by 1100010100111100110111100101101110000000= 297,373,948,800, discarding the low bit
These bits as a double2.93844504 × 10^-312≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
594,747,897,601 to the power 2353,725,061,700,809,581,555,201
594,747,897,601 to the power 3210,377,236,775,340,503,909,592,342,676,972,801
594,747,897,601 to the power 4125121419275241545461129966784… (48 digits)
594,747,897,601 to the power 5744157010588031463144571118106… (59 digits)
First ten multiples594,747,897,601, 1,189,495,795,202, 1,784,243,692,803, 2,378,991,590,404, 2,973,739,488,005, 3,568,487,385,606, 4,163,235,283,207, 4,757,983,180,808, 5,352,731,078,409, 5,947,478,976,010
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 4
Divisible by 8No, remainder 1
Divisible by 9No, remainder 4
Divisible by 10No, remainder 1
Divisible by 11Yes
Divisible by 12No, remainder 1
Divisible by 100No, remainder 1
Collatz (3n + 1) trajectory
Steps to reach 1272the total stopping time
Highest value reached1,784,243,692,8043× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps594,747,897,601 → 1,784,243,692,804 → 892,121,846,402 → 446,060,923,201 → 1,338,182,769,604 → 669,091,384,802 → 334,545,692,401 → 1,003,637,077,204 → 501,818,538,602 → 250,909,269,301 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage59,474,789,760,100%
594,747,897,601% as a decimal5,947,478,976.01
594,747,897,601% of 100594,747,897,601
594,747,897,601% of 1,0005,947,478,976,010
As a fraction of 100594,747,897,601/100
Read another way
As seconds18,846 years, 154 days and 17 hours
As bytes553.902 GiB
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from 594,747,897,601
Nearby primes
Also reads as
594747897601 (identifier)
- 12 characters
- Checksum fails
594747897601 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