Recognised as Number
2,498,491
- Positive
- Odd
- Composite
- 7 digits
2,498,491 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value2,498,491
Digit count7
Digit sum37
Digit product20,736
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation349 × 7,159
Distinct prime factors2349, 7,159
Number of divisors4
Sum of divisors σ(n)2,506,000
Aliquot sum7,509sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,490,984integers below n that share no factor with it
Carmichael function λ(n)415,164the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,490,984
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 349, 7,159, 2,498,4914 in total
Arithmetic
Previous number2,498,490
Next number2,498,492
Double4,996,982
Half1,249,245.5
Square6,242,457,277,081
Cube15,596,723,324,671,384,771
Square root1,580.661570356≈irrational, shown to 9 decimal places
Cube root135.693568293≈
Negation-2,498,491
Reciprocal4.00241586 × 10^-7≈
Representations
Decimal2,498,491
Binary100110000111111011101122 bits
Octal11417673
Hexadecimal261FBB
Base 361HJUJ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, four hundred and ninety-eight thousand, four hundred and ninety-one
Ordinaltwo million, four hundred and ninety-eight thousand, four hundred and ninety-first
Scientific notation2.498491 × 10^6
Engineering notation2.498491 × 10^6
In other bases
Ternary11200221021201base 3; the most digit-efficient integer base after e: 14 digits
Quinary1114422431base 5; one hand: 10 digits
Septenary30144142base 7: 8 digits
Nonary4627251base 9; each digit is two ternary digits: 7 digits
Duodecimala05a77base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalfc64bbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal11:34:1:31base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TTT010T110TT01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11110100110000011001111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001001100001111110111011
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 odd
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes326 1f bb
Gray code1101010001000001100110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001001100001111110111011
64-bit0000000000000000000000000000000000000000001001100001111110111011
One's complement11111111110110011110000001000100at 32 bits, every bit flipped
Bits reversed11011101111110000110010000000000at 32 bits
Rotated left by 100000000010011000011111101110110at 32 bits, wrapping
Shifted left by 110011000011111101110110= 4,996,982, no wrap
Shifted right by 1100110000111111011101= 1,249,245, discarding the low bit
These bits as a double1.23441857 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,498,491 to the power 26,242,457,277,081
2,498,491 to the power 315,596,723,324,671,384,771
2,498,491 to the power 438,968,272,856,181,532,807,880,561
2,498,491 to the power 597,361,879,016,713,854,086,694,310,733,451
First ten multiples2,498,491, 4,996,982, 7,495,473, 9,993,964, 12,492,455, 14,990,946, 17,489,437, 19,987,928, 22,486,419, 24,984,910
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 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 2
Divisible by 8No, remainder 3
Divisible by 9No, remainder 1
Divisible by 10No, remainder 1
Divisible by 11No, remainder 6
Divisible by 12No, remainder 7
Divisible by 100No, remainder 91
Collatz (3n + 1) trajectory
Steps to reach 168the total stopping time
Highest value reached12,648,6165× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,498,491 → 7,495,474 → 3,747,737 → 11,243,212 → 5,621,606 → 2,810,803 → 8,432,410 → 4,216,205 → 12,648,616 → 6,324,308 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage249,849,100%
2,498,491% as a decimal24,984.91
2,498,491% of 1002,498,491
2,498,491% of 1,00024,984,910
As a fraction of 1002,498,491/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,498,491
Nerdulate something else
Nothing in mind? Surprise me · today’s page