Recognised as Number
2,239,749
- Positive
- Odd
- Composite
- 7 digits
2,239,749 is an odd 7-digit integer and a composite number. It has 6 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value2,239,749
Digit count7
Digit sum36
Digit product27,216
Multiplicative persistence5times 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 factorisation3^2 × 248,861
Distinct prime factors23, 248,861
Number of divisors6
Sum of divisors σ(n)3,235,206
Aliquot sum995,457sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,493,160integers below n that share no factor with it
Carmichael function λ(n)746,580the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,493,160
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 248,861, 746,583, 2,239,7496 in total
Arithmetic
Previous number2,239,748
Next number2,239,750
Double4,479,498
Half1,119,874.5
Square5,016,475,583,001
Cube11,235,646,170,550,906,749
Square root1,496.579099146≈irrational, shown to 9 decimal places
Cube root130.837765096≈
Negation-2,239,749
Reciprocal4.46478601 × 10^-7≈
Representations
Decimal2,239,749
Binary100010001011010000010122 bits
Octal10426405
Hexadecimal222D05
Base 361C079
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, two hundred and thirty-nine thousand, seven hundred and forty-nine
Ordinaltwo million, two hundred and thirty-nine thousand, seven hundred and forty-ninth
Scientific notation2.239749 × 10^6
Engineering notation2.239749 × 10^6
In other bases
Ternary11012210100200base 3; the most digit-efficient integer base after e: 14 digits
Quinary1033132444base 5; one hand: 10 digits
Septenary25015611base 7: 8 digits
Nonary4183320base 9; each digit is two ternary digits: 7 digits
Duodecimal900199base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimaldjj79base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal10:22:9:9base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary111T0T10101T00digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001100111110100000101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001000100010110100000101
Bit length22 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits14within that length
Bit parityeven8 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 2d 05
Gray code1100110011101110000111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001000100010110100000101
64-bit0000000000000000000000000000000000000000001000100010110100000101
One's complement11111111110111011101001011111010at 32 bits, every bit flipped
Bits reversed10100000101101000100010000000000at 32 bits
Rotated left by 100000000010001000101101000001010at 32 bits, wrapping
Shifted left by 110001000101101000001010= 4,479,498, no wrap
Shifted right by 1100010001011010000010= 1,119,874, discarding the low bit
These bits as a double1.10658304 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,239,749 to the power 25,016,475,583,001
2,239,749 to the power 311,235,646,170,550,906,749
2,239,749 to the power 425,165,027,274,845,222,840,166,001
2,239,749 to the power 556,363,344,673,807,313,011,038,960,573,749
First ten multiples2,239,749, 4,479,498, 6,719,247, 8,958,996, 11,198,745, 13,438,494, 15,678,243, 17,917,992, 20,157,741, 22,397,490
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 3
Divisible by 7No, remainder 1
Divisible by 8No, remainder 5
Divisible by 9Yes
Divisible by 10No, remainder 9
Divisible by 11No, remainder 6
Divisible by 12No, remainder 9
Divisible by 100No, remainder 49
Collatz (3n + 1) trajectory
Steps to reach 186the total stopping time
Highest value reached6,719,2483× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,239,749 → 6,719,248 → 3,359,624 → 1,679,812 → 839,906 → 419,953 → 1,259,860 → 629,930 → 314,965 → 944,896 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage223,974,900%
2,239,749% as a decimal22,397.49
2,239,749% of 1002,239,749
2,239,749% of 1,00022,397,490
As a fraction of 1002,239,749/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,239,749
Nerdulate something else
Nothing in mind? Surprise me · today’s page