Nerdulator> put something in

Recognised as Number

5,559,391

  • Positive
  • Odd
  • Composite
  • 7 digits

5,559,391 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,559,391
Digit count7
Digit sum37
Digit product30,375
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation17 × 327,023
Distinct prime factors217, 327,023
Number of divisors4
Sum of divisors σ(n)5,886,432
Aliquot sum327,041sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)5,232,352integers below n that share no factor with it
Carmichael function λ(n)2,616,176the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 5,232,352
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 17, 327,023, 5,559,3914 in total

Arithmetic

Previous number5,559,390
Next number5,559,392
Cube171,823,143,038,869,213,471
Square root2,357.836084209≈irrational, shown to 9 decimal places
Cube root177.150509834≈
Negation-5,559,391
Reciprocal1.79875817 × 10^-7≈

Representations

Decimal5,559,391
Binary1010100110101000101111123 bits
Octal25152137
Hexadecimal54D45F
Base 363B5NJ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfive million, five hundred and fifty-nine thousand, three hundred and ninety-one
Ordinalfive million, five hundred and fifty-nine thousand, three hundred and ninety-first
Scientific notation5.559391 × 10^6
Engineering notation5.559391 × 10^6

In other bases

Ternary101110110001101base 3; the most digit-efficient integer base after e: 15 digits
Quinary2410400031base 5; one hand: 10 digits
Septenary65153065base 7: 8 digits
Nonary11413041base 9; each digit is two ternary digits: 8 digits
Duodecimal1a412a7base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1eei9bbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal25:44:16:31base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary101110110001101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10101011101010110100011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000010101001101010001011111
Bit length23 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits10within that length
Bit parityodd13 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
Bytes354 d4 5f
Gray code11111101011111001110000n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000010101001101010001011111
64-bit0000000000000000000000000000000000000000010101001101010001011111
One's complement11111111101010110010101110100000at 32 bits, every bit flipped
Bits reversed11111010001010110010101000000000at 32 bits
Rotated left by 100000000101010011010100010111110at 32 bits, wrapping
Shifted left by 1101010011010100010111110= 11,118,782, no wrap
Shifted right by 11010100110101000101111= 2,779,695, discarding the low bit
These bits as a double2.7467041 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime5,559,401+10
Previous prime5,559,383−8
Distance to nearest prime8
Nearest square below5,555,449
Nearest square above5,560,164

Powers & multiples

5,559,391 to the power 230,906,828,290,881
5,559,391 to the power 3171,823,143,038,869,213,471
5,559,391 to the power 4955,232,035,002,002,155,547,756,161
5,559,391 to the power 55,310,508,378,301,815,765,532,795,671,657,951
First ten multiples5,559,391, 11,118,782, 16,678,173, 22,237,564, 27,796,955, 33,356,346, 38,915,737, 44,475,128, 50,034,519, 55,593,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 5
Divisible by 8No, remainder 7
Divisible by 9No, remainder 1
Divisible by 10No, remainder 1
Divisible by 11No, remainder 2
Divisible by 12No, remainder 7
Divisible by 100No, remainder 91

Collatz (3n + 1) trajectory

Steps to reach 1307the total stopping time
Highest value reached84,433,26415× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps5,559,391 → 16,678,174 → 8,339,087 → 25,017,262 → 12,508,631 → 37,525,894 → 18,762,947 → 56,288,842 → 28,144,421 → 84,433,264 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage555,939,100%
5,559,391% as a decimal55,593.91
5,559,391% of 1005,559,391
5,559,391% of 1,00055,593,910
As a fraction of 1005,559,391/100

Read another way

As bytes5.302 MiB
As a 24-bit colour#54D45F

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “5559391” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.