Recognised as Number
2,249,587
- Positive
- Odd
- Composite
- 7 digits
2,249,587 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 value2,249,587
Digit count7
Digit sum37
Digit product40,320
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 factorisation389 × 5,783
Distinct prime factors2389, 5,783
Number of divisors4
Sum of divisors σ(n)2,255,760
Aliquot sum6,173sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,243,416integers below n that share no factor with it
Carmichael function λ(n)1,121,708the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,243,416
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 389, 5,783, 2,249,5874 in total
Arithmetic
Previous number2,249,586
Next number2,249,588
Double4,499,174
Half1,124,793.5
Square5,060,641,670,569
Cube11,384,353,713,770,305,003
Square root1,499.862327015≈irrational, shown to 9 decimal places
Cube root131.029051692≈
Negation-2,249,587
Reciprocal4.4452604 × 10^-7≈
Representations
Decimal2,249,587
Binary100010010100110111001122 bits
Octal10451563
Hexadecimal225373
Base 361C7SJ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, two hundred and forty-nine thousand, five hundred and eighty-seven
Ordinaltwo million, two hundred and forty-nine thousand, five hundred and eighty-seventh
Scientific notation2.249587 × 10^6
Engineering notation2.249587 × 10^6
In other bases
Ternary11020021212001base 3; the most digit-efficient integer base after e: 14 digits
Quinary1033441322base 5; one hand: 10 digits
Septenary25056364base 7: 8 digits
Nonary4207761base 9; each digit is two ternary digits: 7 digits
Duodecimal905a17base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimale13j7base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal10:24:53:7base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary111T010T0TT001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001100101010010110111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001000100101001101110011
Bit length22 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits11within that length
Bit parityodd11 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes322 53 73
Gray code1100110111101011001010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001000100101001101110011
64-bit0000000000000000000000000000000000000000001000100101001101110011
One's complement11111111110111011010110010001100at 32 bits, every bit flipped
Bits reversed11001110110010100100010000000000at 32 bits
Rotated left by 100000000010001001010011011100110at 32 bits, wrapping
Shifted left by 110001001010011011100110= 4,499,174, no wrap
Shifted right by 1100010010100110111001= 1,124,793, discarding the low bit
These bits as a double1.11144365 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,249,587 to the power 25,060,641,670,569
2,249,587 to the power 311,384,353,713,770,305,003
2,249,587 to the power 425,610,094,117,899,399,120,783,761
2,249,587 to the power 557,612,134,796,402,955,569,926,578,556,707
First ten multiples2,249,587, 4,499,174, 6,748,761, 8,998,348, 11,247,935, 13,497,522, 15,747,109, 17,996,696, 20,246,283, 22,495,870
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 4
Divisible by 8No, remainder 3
Divisible by 9No, remainder 1
Divisible by 10No, remainder 7
Divisible by 11No, remainder 10
Divisible by 12No, remainder 7
Divisible by 100No, remainder 87
Collatz (3n + 1) trajectory
Steps to reach 1148the total stopping time
Highest value reached10,123,1444× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,249,587 → 6,748,762 → 3,374,381 → 10,123,144 → 5,061,572 → 2,530,786 → 1,265,393 → 3,796,180 → 1,898,090 → 949,045 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage224,958,700%
2,249,587% as a decimal22,495.87
2,249,587% of 1002,249,587
2,249,587% of 1,00022,495,870
As a fraction of 1002,249,587/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 2,249,587
Nerdulate something else
Nothing in mind? Surprise me · today’s page