Recognised as Number
5,337,191
- Positive
- Odd
- Composite
- 7 digits
5,337,191 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value5,337,191
Digit count7
Digit sum29
Digit product2,835
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation811 × 6,581
Distinct prime factors2811, 6,581
Number of divisors4
Sum of divisors σ(n)5,344,584
Aliquot sum7,393sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)5,329,800integers below n that share no factor with it
Carmichael function λ(n)532,980the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 5,329,800
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 811, 6,581, 5,337,1914 in total
Arithmetic
Previous number5,337,190
Next number5,337,192
Double10,674,382
Half2,668,595.5
Square28,485,607,770,481
Cube152,033,129,422,141,258,871
Square root2,310.236135117≈irrational, shown to 9 decimal places
Cube root174.758207573≈
Negation-5,337,191
Reciprocal1.87364477 × 10^-7≈
Representations
Decimal5,337,191
Binary1010001011100000110011123 bits
Octal24270147
Hexadecimal517067
Base 3636E7B
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfive million, three hundred and thirty-seven thousand, one hundred and ninety-one
Ordinalfive million, three hundred and thirty-seven thousand, one hundred and ninety-first
Scientific notation5.337191 × 10^6
Engineering notation5.337191 × 10^6
In other bases
Ternary101001011020202base 3; the most digit-efficient integer base after e: 15 digits
Quinary2331242231base 5; one hand: 10 digits
Septenary63236216base 7: 8 digits
Nonary11034222base 9; each digit is two ternary digits: 8 digits
Duodecimal195479bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1d72jbbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal24:42:33:11base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1010010111T1T1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10101101011000110111011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000010100010111000001100111
Bit length23 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits12within that length
Bit parityodd11 set bits, so odd; 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
Bytes351 70 67
Gray code11110011100100001010100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000010100010111000001100111
64-bit0000000000000000000000000000000000000000010100010111000001100111
One's complement11111111101011101000111110011000at 32 bits, every bit flipped
Bits reversed11100110000011101000101000000000at 32 bits
Rotated left by 100000000101000101110000011001110at 32 bits, wrapping
Shifted left by 1101000101110000011001110= 10,674,382, no wrap
Shifted right by 11010001011100000110011= 2,668,595, discarding the low bit
These bits as a double2.63692272 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
5,337,191 to the power 228,485,607,770,481
5,337,191 to the power 3152,033,129,422,141,258,871
5,337,191 to the power 4811,429,850,053,687,527,574,971,361
5,337,191 to the power 54,330,756,092,837,890,588,985,388,973,186,951
First ten multiples5,337,191, 10,674,382, 16,011,573, 21,348,764, 26,685,955, 32,023,146, 37,360,337, 42,697,528, 48,034,719, 53,371,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 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 6
Divisible by 8No, remainder 7
Divisible by 9No, remainder 2
Divisible by 10No, remainder 1
Divisible by 11No, remainder 2
Divisible by 12No, remainder 11
Divisible by 100No, remainder 91
Collatz (3n + 1) trajectory
Steps to reach 1263the total stopping time
Highest value reached91,190,93217× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps5,337,191 → 16,011,574 → 8,005,787 → 24,017,362 → 12,008,681 → 36,026,044 → 18,013,022 → 9,006,511 → 27,019,534 → 13,509,767 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage533,719,100%
5,337,191% as a decimal53,371.91
5,337,191% of 1005,337,191
5,337,191% of 1,00053,371,910
As a fraction of 1005,337,191/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,337,191
Nerdulate something else
Nothing in mind? Surprise me · today’s page