Recognised as Number
2,849,238
- Positive
- Even
- Composite
- 7 digits
2,849,238 is an even 7-digit integer and a composite number. It has 24 divisors and a digital root of 9.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value2,849,238
Digit count7
Digit sum36
Digit product27,648
Multiplicative persistence7times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 3^2 × 7 × 22,613
Distinct prime factors42, 3, 7, 22,613
Number of divisors24
Sum of divisors σ(n)7,055,568
Aliquot sum4,206,330sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)814,032integers below n that share no factor with it
Carmichael function λ(n)67,836the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 814,032
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 6, 7, 9, 14, 18, 21, 42, 63, 126, 22,613, 45,226, 67,839, 135,678, 158,291, 203,517, 316,582, 407,034, 474,873, 949,746, 1,424,619, 2,849,23824 in total
Arithmetic
Previous number2,849,237
Next number2,849,239
Double5,698,476
Half1,424,619
Square8,118,157,180,644
Cube23,130,561,929,063,749,272
Square root1,687.968601604≈irrational, shown to 9 decimal places
Cube root141.767356944≈
Negation-2,849,238
Reciprocal3.50971032 × 10^-7≈
Representations
Decimal2,849,238
Binary101011011110011101011022 bits
Octal12674726
Hexadecimal2B79D6
Base 361P2HI
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, eight hundred and forty-nine thousand, two hundred and thirty-eight
Ordinaltwo million, eight hundred and forty-nine thousand, two hundred and thirty-eighth
Scientific notation2.849238 × 10^6
Engineering notation2.849238 × 10^6
In other bases
Ternary12100202102100base 3; the most digit-efficient integer base after e: 14 digits
Quinary1212133423base 5; one hand: 10 digits
Septenary33134550base 7: 8 digits
Nonary5322370base 9; each digit is two ternary digits: 7 digits
Duodecimalb54a46base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalhg31ibase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal13:11:27:18base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TT101T1T11T100digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11111001000111000101010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001010110111100111010110
Bit length22 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits8within that length
Bit parityeven14 set bits, so even; not the same as the number itself being even
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes32b 79 d6
Gray code1111101100010100111101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001010110111100111010110
64-bit0000000000000000000000000000000000000000001010110111100111010110
One's complement11111111110101001000011000101001at 32 bits, every bit flipped
Bits reversed01101011100111101101010000000000at 32 bits
Rotated left by 100000000010101101111001110101100at 32 bits, wrapping
Shifted left by 110101101111001110101100= 5,698,476, no wrap
Shifted right by 1101011011110011101011= 1,424,619, discarding the low bit
These bits as a double1.40771061 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,849,238 to the power 28,118,157,180,644
2,849,238 to the power 323,130,561,929,063,749,272
2,849,238 to the power 465,904,476,009,641,738,848,254,736
2,849,238 to the power 5187,777,537,416,759,608,712,523,627,491,168
First ten multiples2,849,238, 5,698,476, 8,547,714, 11,396,952, 14,246,190, 17,095,428, 19,944,666, 22,793,904, 25,643,142, 28,492,380
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4No, remainder 2
Divisible by 5No, remainder 3
Divisible by 6Yes
Divisible by 7Yes
Divisible by 8No, remainder 6
Divisible by 9Yes
Divisible by 10No, remainder 8
Divisible by 11No, remainder 7
Divisible by 12No, remainder 6
Divisible by 100No, remainder 38
Collatz (3n + 1) trajectory
Steps to reach 1187the total stopping time
Highest value reached249,814,99687× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,849,238 → 1,424,619 → 4,273,858 → 2,136,929 → 6,410,788 → 3,205,394 → 1,602,697 → 4,808,092 → 2,404,046 → 1,202,023 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage284,923,800%
2,849,238% as a decimal28,492.38
2,849,238% of 1002,849,238
2,849,238% of 1,00028,492,380
As a fraction of 1002,849,238/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,849,238
Nerdulate something else
Nothing in mind? Surprise me · today’s page