Recognised as Number
2,249,591
- Positive
- Odd
- Prime
- 7 digits
2,249,591 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value2,249,591
Digit count7
Digit sum32
Digit product6,480
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2,249,591
Distinct prime factors12,249,591
Number of divisors2
Sum of divisors σ(n)2,249,592
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,249,590integers below n that share no factor with it
Carmichael function λ(n)2,249,590the 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, 2,249,5912 in total
Arithmetic
Previous number2,249,590
Next number2,249,592
Double4,499,182
Half1,124,795.5
Square5,060,659,667,281
Cube11,384,414,441,578,332,071
Square root1,499.863660471≈irrational, shown to 9 decimal places
Cube root131.029129354≈
Negation-2,249,591
Reciprocal4.44525249 × 10^-7≈
Representations
Decimal2,249,591
Binary100010010100110111011122 bits
Octal10451567
Hexadecimal225377
Base 361C7SN
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, two hundred and forty-nine thousand, five hundred and ninety-one
Ordinaltwo million, two hundred and forty-nine thousand, five hundred and ninety-first
Scientific notation2.249591 × 10^6
Engineering notation2.249591 × 10^6
In other bases
Ternary11020021212012base 3; the most digit-efficient integer base after e: 14 digits
Quinary1033441331base 5; one hand: 10 digits
Septenary25056401base 7: 8 digits
Nonary4207765base 9; each digit is two ternary digits: 7 digits
Duodecimal905a1bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimale13jbbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal10:24:53:11base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary111T010T0TT1TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001100101010010001011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001000100101001101110111
Bit length22 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits10within that length
Bit parityeven12 set bits, so even; 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 77
Gray code1100110111101011001100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001000100101001101110111
64-bit0000000000000000000000000000000000000000001000100101001101110111
One's complement11111111110111011010110010001000at 32 bits, every bit flipped
Bits reversed11101110110010100100010000000000at 32 bits
Rotated left by 100000000010001001010011011101110at 32 bits, wrapping
Shifted left by 110001001010011011101110= 4,499,182, no wrap
Shifted right by 1100010010100110111011= 1,124,795, discarding the low bit
These bits as a double1.11144563 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,249,591 to the power 25,060,659,667,281
2,249,591 to the power 311,384,414,441,578,332,071
2,249,591 to the power 425,610,276,268,044,641,621,932,961
2,249,591 to the power 557,612,647,000,106,813,390,925,791,668,951
First ten multiples2,249,591, 4,499,182, 6,748,773, 8,998,364, 11,247,955, 13,497,546, 15,747,137, 17,996,728, 20,246,319, 22,495,910
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 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 7
Divisible by 9No, remainder 5
Divisible by 10No, remainder 1
Divisible by 11No, remainder 3
Divisible by 12No, remainder 11
Divisible by 100No, remainder 91
Collatz (3n + 1) trajectory
Steps to reach 1254the total stopping time
Highest value reached15,184,7446× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,249,591 → 6,748,774 → 3,374,387 → 10,123,162 → 5,061,581 → 15,184,744 → 7,592,372 → 3,796,186 → 1,898,093 → 5,694,280 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage224,959,100%
2,249,591% as a decimal22,495.91
2,249,591% of 1002,249,591
2,249,591% of 1,00022,495,910
As a fraction of 1002,249,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 2,249,591
Nerdulate something else
Nothing in mind? Surprise me · today’s page