Recognised as Number
2,490,138
- Positive
- Even
- Composite
- 7 digits
2,490,138 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,490,138
Digit count7
Digit sum27
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 × 19,763
Distinct prime factors42, 3, 7, 19,763
Number of divisors24
Sum of divisors σ(n)6,166,368
Aliquot sum3,676,230sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)711,432integers below n that share no factor with it
Carmichael function λ(n)59,286the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 711,432
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, 19,763, 39,526, 59,289, 118,578, 138,341, 177,867, 276,682, 355,734, 415,023, 830,046, 1,245,069, 2,490,13824 in total
Arithmetic
Previous number2,490,137
Next number2,490,139
Double4,980,276
Half1,245,069
Square6,200,787,259,044
Cube15,440,815,983,661,308,072
Square root1,578.017110173≈irrational, shown to 9 decimal places
Cube root135.542181736≈
Negation-2,490,138
Reciprocal4.01584169 × 10^-7≈
Representations
Decimal2,490,138
Binary100101111111110001101022 bits
Octal11377432
Hexadecimal25FF1A
Base 361HDEI
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, four hundred and ninety thousand, one hundred and thirty-eight
Ordinaltwo million, four hundred and ninety thousand, one hundred and thirty-eighth
Scientific notation2.490138 × 10^6
Engineering notation2.490138 × 10^6
In other bases
Ternary11200111211100base 3; the most digit-efficient integer base after e: 14 digits
Quinary1114141023base 5; one hand: 10 digits
Septenary30110610base 7: 8 digits
Nonary4614740base 9; each digit is two ternary digits: 7 digits
Duodecimala01076base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalfb56ibase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal11:31:42:18base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TTT01TTTT11100digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11110100000001101101110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001001011111111100011010
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
Bytes325 ff 1a
Gray code1101110000000010010111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001001011111111100011010
64-bit0000000000000000000000000000000000000000001001011111111100011010
One's complement11111111110110100000000011100101at 32 bits, every bit flipped
Bits reversed01011000111111111010010000000000at 32 bits
Rotated left by 100000000010010111111111000110100at 32 bits, wrapping
Shifted left by 110010111111111000110100= 4,980,276, no wrap
Shifted right by 1100101111111110001101= 1,245,069, discarding the low bit
These bits as a double1.23029164 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,490,138 to the power 26,200,787,259,044
2,490,138 to the power 315,440,815,983,661,308,072
2,490,138 to the power 438,449,762,631,922,402,359,793,936
2,490,138 to the power 595,745,215,020,729,987,167,412,552,203,168
First ten multiples2,490,138, 4,980,276, 7,470,414, 9,960,552, 12,450,690, 14,940,828, 17,430,966, 19,921,104, 22,411,242, 24,901,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 2
Divisible by 9Yes
Divisible by 10No, remainder 8
Divisible by 11No, remainder 2
Divisible by 12No, remainder 6
Divisible by 100No, remainder 38
Collatz (3n + 1) trajectory
Steps to reach 199the total stopping time
Highest value reached3,735,2081× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,490,138 → 1,245,069 → 3,735,208 → 1,867,604 → 933,802 → 466,901 → 1,400,704 → 700,352 → 350,176 → 175,088 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage249,013,800%
2,490,138% as a decimal24,901.38
2,490,138% of 1002,490,138
2,490,138% of 1,00024,901,380
As a fraction of 1002,490,138/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,490,138
Nerdulate something else
Nothing in mind? Surprise me · today’s page