Recognised as Number
2,444,129
- Positive
- Odd
- Prime
- 7 digits
2,444,129 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value2,444,129
Digit count7
Digit sum26
Digit product2,304
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2,444,129
Distinct prime factors12,444,129
Number of divisors2
Sum of divisors σ(n)2,444,130
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,444,128integers below n that share no factor with it
Carmichael function λ(n)2,444,128the 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,444,1292 in total
Arithmetic
Previous number2,444,128
Next number2,444,130
Double4,888,258
Half1,222,064.5
Square5,973,766,568,641
Cube14,600,656,109,645,958,689
Square root1,563.371037214≈irrational, shown to 9 decimal places
Cube root134.702205953≈
Negation-2,444,129
Reciprocal4.09143707 × 10^-7≈
Representations
Decimal2,444,129
Binary100101010010110110000122 bits
Octal11245541
Hexadecimal254B61
Base 361GDWH
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, four hundred and forty-four thousand, one hundred and twenty-nine
Ordinaltwo million, four hundred and forty-four thousand, one hundred and twenty-ninth
Scientific notation2.444129 × 10^6
Engineering notation2.444129 × 10^6
In other bases
Ternary11121011201022base 3; the most digit-efficient integer base after e: 14 digits
Quinary1111203004base 5; one hand: 10 digits
Septenary26526512base 7: 8 digits
Nonary4534638base 9; each digit is two ternary digits: 7 digits
Duodecimal99a515base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalf5a69base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal11:18:55:29base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TTTT11TTT0110Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001010101110010100001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001001010100101101100001
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
Bytes325 4b 61
Gray code1101111110111011010001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001001010100101101100001
64-bit0000000000000000000000000000000000000000001001010100101101100001
One's complement11111111110110101011010010011110at 32 bits, every bit flipped
Bits reversed10000110110100101010010000000000at 32 bits
Rotated left by 100000000010010101001011011000010at 32 bits, wrapping
Shifted left by 110010101001011011000010= 4,888,258, no wrap
Shifted right by 1100101010010110110000= 1,222,064, discarding the low bit
These bits as a double1.20756017 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,444,129 to the power 25,973,766,568,641
2,444,129 to the power 314,600,656,109,645,958,689
2,444,129 to the power 435,685,887,016,612,867,364,586,881
2,444,129 to the power 587,220,911,348,026,990,898,940,368,871,649
First ten multiples2,444,129, 4,888,258, 7,332,387, 9,776,516, 12,220,645, 14,664,774, 17,108,903, 19,553,032, 21,997,161, 24,441,290
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 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 2
Divisible by 8No, remainder 1
Divisible by 9No, remainder 8
Divisible by 10No, remainder 9
Divisible by 11No, remainder 6
Divisible by 12No, remainder 5
Divisible by 100No, remainder 29
Collatz (3n + 1) trajectory
Steps to reach 1218the total stopping time
Highest value reached30,135,40012× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,444,129 → 7,332,388 → 3,666,194 → 1,833,097 → 5,499,292 → 2,749,646 → 1,374,823 → 4,124,470 → 2,062,235 → 6,186,706 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage244,412,900%
2,444,129% as a decimal24,441.29
2,444,129% of 1002,444,129
2,444,129% of 1,00024,441,290
As a fraction of 1002,444,129/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,444,129
Nerdulate something else
Nothing in mind? Surprise me · today’s page