Recognised as Number
2,249,141
- Positive
- Odd
- Prime
- 7 digits
2,249,141 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,141
Digit count7
Digit sum23
Digit product576
Multiplicative persistence3times 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,141
Distinct prime factors12,249,141
Number of divisors2
Sum of divisors σ(n)2,249,142
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,249,140integers below n that share no factor with it
Carmichael function λ(n)2,249,140the 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,1412 in total
Arithmetic
Previous number2,249,140
Next number2,249,142
Double4,498,282
Half1,124,570.5
Square5,058,635,237,881
Cube11,377,583,917,562,910,221
Square root1,499.713639333≈irrational, shown to 9 decimal places
Cube root131.020391907≈
Negation-2,249,141
Reciprocal4.44614188 × 10^-7≈
Representations
Decimal2,249,141
Binary100010010100011011010122 bits
Octal10450665
Hexadecimal2251B5
Base 361C7G5
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, two hundred and forty-nine thousand, one hundred and forty-one
Ordinaltwo million, two hundred and forty-nine thousand, one hundred and forty-first
Scientific notation2.249141 × 10^6
Engineering notation2.249141 × 10^6
In other bases
Ternary11020021020112base 3; the most digit-efficient integer base after e: 14 digits
Quinary1033433031base 5; one hand: 10 digits
Septenary25055156base 7: 8 digits
Nonary4207215base 9; each digit is two ternary digits: 7 digits
Duodecimal905705base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimale12h1base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal10:24:45:41base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary111T01T11T1TTTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001100101011011110101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001000100101000110110101
Bit length22 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits12within that length
Bit parityeven10 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 51 b5
Gray code1100110111100101101111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001000100101000110110101
64-bit0000000000000000000000000000000000000000001000100101000110110101
One's complement11111111110111011010111001001010at 32 bits, every bit flipped
Bits reversed10101101100010100100010000000000at 32 bits
Rotated left by 100000000010001001010001101101010at 32 bits, wrapping
Shifted left by 110001001010001101101010= 4,498,282, no wrap
Shifted right by 1100010010100011011010= 1,124,570, discarding the low bit
These bits as a double1.1112233 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,249,141 to the power 25,058,635,237,881
2,249,141 to the power 311,377,583,917,562,910,221
2,249,141 to the power 425,589,790,469,931,361,457,370,161
2,249,141 to the power 557,555,046,927,331,892,239,590,981,281,701
First ten multiples2,249,141, 4,498,282, 6,747,423, 8,996,564, 11,245,705, 13,494,846, 15,743,987, 17,993,128, 20,242,269, 22,491,410
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 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 6
Divisible by 8No, remainder 5
Divisible by 9No, remainder 5
Divisible by 10No, remainder 1
Divisible by 11No, remainder 4
Divisible by 12No, remainder 5
Divisible by 100No, remainder 41
Collatz (3n + 1) trajectory
Steps to reach 1254the total stopping time
Highest value reached6,747,4243× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,249,141 → 6,747,424 → 3,373,712 → 1,686,856 → 843,428 → 421,714 → 210,857 → 632,572 → 316,286 → 158,143 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage224,914,100%
2,249,141% as a decimal22,491.41
2,249,141% of 1002,249,141
2,249,141% of 1,00022,491,410
As a fraction of 1002,249,141/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,141
Nerdulate something else
Nothing in mind? Surprise me · today’s page