Recognised as Number
5,791,591
- Positive
- Odd
- Composite
- 7 digits
5,791,591 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value5,791,591
Digit count7
Digit sum37
Digit product14,175
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation13 × 445,507
Distinct prime factors213, 445,507
Number of divisors4
Sum of divisors σ(n)6,237,112
Aliquot sum445,521sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)5,346,072integers below n that share no factor with it
Carmichael function λ(n)891,012the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 5,346,072
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 13, 445,507, 5,791,5914 in total
Arithmetic
Previous number5,791,590
Next number5,791,592
Double11,583,182
Half2,895,795.5
Square33,542,526,311,281
Cube194,264,593,501,678,238,071
Square root2,406.572458913≈irrational, shown to 9 decimal places
Cube root179.583305657≈
Negation-5,791,591
Reciprocal1.72664126 × 10^-7≈
Representations
Decimal5,791,591
Binary1011000010111110110011123 bits
Octal26057547
Hexadecimal585F67
Base 363G4TJ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfive million, seven hundred and ninety-one thousand, five hundred and ninety-one
Ordinalfive million, seven hundred and ninety-one thousand, five hundred and ninety-first
Scientific notation5.791591 × 10^6
Engineering notation5.791591 × 10^6
In other bases
Ternary101220020120101base 3; the most digit-efficient integer base after e: 15 digits
Quinary2440312331base 5; one hand: 10 digits
Septenary100141051base 7: 9 digits
Nonary11806511base 9; each digit is two ternary digits: 8 digits
Duodecimal1b33747base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1g3ijbbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal26:48:46:31base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11T0T01T1TT0101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101010011010000010111011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010110000101111101100111
Bit length23 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits9within that length
Bit parityeven14 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
Bytes358 5f 67
Gray code11101000111000011010100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010110000101111101100111
64-bit0000000000000000000000000000000000000000010110000101111101100111
One's complement11111111101001111010000010011000at 32 bits, every bit flipped
Bits reversed11100110111110100001101000000000at 32 bits
Rotated left by 100000000101100001011111011001110at 32 bits, wrapping
Shifted left by 1101100001011111011001110= 11,583,182, no wrap
Shifted right by 11011000010111110110011= 2,895,795, discarding the low bit
These bits as a double2.86142615 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
5,791,591 to the power 233,542,526,311,281
5,791,591 to the power 3194,264,593,501,678,238,071
5,791,591 to the power 41,125,101,071,342,978,168,507,860,961
5,791,591 to the power 56,516,125,238,880,350,273,926,610,970,978,951
First ten multiples5,791,591, 11,583,182, 17,374,773, 23,166,364, 28,957,955, 34,749,546, 40,541,137, 46,332,728, 52,124,319, 57,915,910
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 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 1
Divisible by 8No, remainder 7
Divisible by 9No, remainder 1
Divisible by 10No, remainder 1
Divisible by 11No, remainder 3
Divisible by 12No, remainder 7
Divisible by 100No, remainder 91
Collatz (3n + 1) trajectory
Steps to reach 1183the total stopping time
Highest value reached500,958,59286× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps5,791,591 → 17,374,774 → 8,687,387 → 26,062,162 → 13,031,081 → 39,093,244 → 19,546,622 → 9,773,311 → 29,319,934 → 14,659,967 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage579,159,100%
5,791,591% as a decimal57,915.91
5,791,591% of 1005,791,591
5,791,591% of 1,00057,915,910
As a fraction of 1005,791,591/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,791,591
Nerdulate something else
Nothing in mind? Surprise me · today’s page