Recognised as Number
5,571,989
- Positive
- Odd
- Prime
- 7 digits
5,571,989 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value5,571,989
Digit count7
Digit sum44
Digit product113,400
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation5,571,989
Distinct prime factors15,571,989
Number of divisors2
Sum of divisors σ(n)5,571,990
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)5,571,988integers below n that share no factor with it
Carmichael function λ(n)5,571,988the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 5,571,9892 in total
Arithmetic
Previous number5,571,988
Next number5,571,990
Double11,143,978
Half2,785,994.5
Square31,047,061,416,121
Cube172,993,884,692,950,634,669
Square root2,360.506089804≈irrational, shown to 9 decimal places
Cube root177.284221031≈
Negation-5,571,989
Reciprocal1.79469127 × 10^-7≈
Representations
Decimal5,571,989
Binary1010101000001011001010123 bits
Octal25202625
Hexadecimal550595
Base 363BFDH
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfive million, five hundred and seventy-one thousand, nine hundred and eighty-nine
Ordinalfive million, five hundred and seventy-one thousand, nine hundred and eighty-ninth
Scientific notation5.571989 × 10^6
Engineering notation5.571989 × 10^6
In other bases
Ternary101111002022222base 3; the most digit-efficient integer base after e: 15 digits
Quinary2411300424base 5; one hand: 10 digits
Septenary65234603base 7: 8 digits
Nonary11432288base 9; each digit is two ternary digits: 8 digits
Duodecimal1a48645base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1eg9j9base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal25:47:46:29base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10111101T10000Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10101010001101010010101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010101010000010110010101
Bit length23 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits13within that length
Bit parityeven10 set bits, so even; not the same as the number itself being odd
Highest set bitbit 22worth 4,194,304
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes355 05 95
Gray code11111111000011101011111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010101010000010110010101
64-bit0000000000000000000000000000000000000000010101010000010110010101
One's complement11111111101010101111101001101010at 32 bits, every bit flipped
Bits reversed10101001101000001010101000000000at 32 bits
Rotated left by 100000000101010100000101100101010at 32 bits, wrapping
Shifted left by 1101010100000101100101010= 11,143,978, no wrap
Shifted right by 11010101000001011001010= 2,785,994, discarding the low bit
These bits as a double2.75292834 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
5,571,989 to the power 231,047,061,416,121
5,571,989 to the power 3172,993,884,692,950,634,669
5,571,989 to the power 4963,920,022,576,389,313,918,686,641
5,571,989 to the power 55,370,951,762,675,392,916,872,468,858,098,949
First ten multiples5,571,989, 11,143,978, 16,715,967, 22,287,956, 27,859,945, 33,431,934, 39,003,923, 44,575,912, 50,147,901, 55,719,890
Powers of twoBetween 2^22 (4,194,304) and 2^23 (8,388,608)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 3
Divisible by 8No, remainder 5
Divisible by 9No, remainder 8
Divisible by 10No, remainder 9
Divisible by 11No, remainder 5
Divisible by 12No, remainder 5
Divisible by 100No, remainder 89
Collatz (3n + 1) trajectory
Steps to reach 1139the total stopping time
Highest value reached16,715,9683× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps5,571,989 → 16,715,968 → 8,357,984 → 4,178,992 → 2,089,496 → 1,044,748 → 522,374 → 261,187 → 783,562 → 391,781 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage557,198,900%
5,571,989% as a decimal55,719.89
5,571,989% of 1005,571,989
5,571,989% of 1,00055,719,890
As a fraction of 1005,571,989/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 5,571,989
Nerdulate something else
Nothing in mind? Surprise me · today’s page