Nerdulator> put something in

Recognised as Number

5,587,261

  • Positive
  • Odd
  • Prime
  • 7 digits

5,587,261 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 7.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value5,587,261
Digit count7
Digit sum34
Digit product16,800
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation5,587,261
Distinct prime factors15,587,261
Number of divisors2
Sum of divisors σ(n)5,587,262
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)5,587,260integers below n that share no factor with it
Carmichael function λ(n)5,587,260the 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,587,2612 in total

Arithmetic

Previous number5,587,260
Next number5,587,262
Cube174,420,239,152,320,860,581
Square root2,363.738775753≈irrational, shown to 9 decimal places
Cube root177.446043244≈
Negation-5,587,261
Reciprocal1.78978573 × 10^-7≈

Representations

Decimal5,587,261
Binary1010101010000010011110123 bits
Octal25240475
Hexadecimal55413D
Base 363BR5P
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfive million, five hundred and eighty-seven thousand, two hundred and sixty-one
Ordinalfive million, five hundred and eighty-seven thousand, two hundred and sixty-first
Scientific notation5.587261 × 10^6
Engineering notation5.587261 × 10^6

In other bases

Ternary101111212021121base 3; the most digit-efficient integer base after e: 15 digits
Quinary2412243021base 5; one hand: 10 digits
Septenary65330251base 7: 8 digits
Nonary11455247base 9; each digit is two ternary digits: 8 digits
Duodecimal1a55451base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1ei831base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal25:52:1:1base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11TTTT0TT10TTT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10101010100000101001101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000010101010100000100111101
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
Bytes355 41 3d
Gray code11111111110000110100011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000010101010100000100111101
64-bit0000000000000000000000000000000000000000010101010100000100111101
One's complement11111111101010101011111011000010at 32 bits, every bit flipped
Bits reversed10111100100000101010101000000000at 32 bits
Rotated left by 100000000101010101000001001111010at 32 bits, wrapping
Shifted left by 1101010101000001001111010= 11,174,522, no wrap
Shifted right by 11010101010000010011110= 2,793,630, discarding the low bit
These bits as a double2.76047371 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime5,587,277+16
Previous prime5,587,249−12
Distance to nearest prime0, it is prime
Nearest square below5,583,769
Nearest square above5,588,496

Powers & multiples

5,587,261 to the power 231,217,485,482,121
5,587,261 to the power 3174,420,239,152,320,860,581
5,587,261 to the power 4974,531,399,826,435,403,810,658,641
5,587,261 to the power 55,444,961,283,525,649,300,730,544,409,172,301
First ten multiples5,587,261, 11,174,522, 16,761,783, 22,349,044, 27,936,305, 33,523,566, 39,110,827, 44,698,088, 50,285,349, 55,872,610
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 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 1
Divisible by 8No, remainder 5
Divisible by 9No, remainder 7
Divisible by 10No, remainder 1
Divisible by 11No, remainder 9
Divisible by 12No, remainder 1
Divisible by 100No, remainder 61

Collatz (3n + 1) trajectory

Steps to reach 1183the total stopping time
Highest value reached16,761,7843× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps5,587,261 → 16,761,784 → 8,380,892 → 4,190,446 → 2,095,223 → 6,285,670 → 3,142,835 → 9,428,506 → 4,714,253 → 14,142,760 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage558,726,100%
5,587,261% as a decimal55,872.61
5,587,261% of 1005,587,261
5,587,261% of 1,00055,872,610
As a fraction of 1005,587,261/100

Read another way

As bytes5.328 MiB
As a 24-bit colour#55413D

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 “5587261” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.