Recognised as Number
2,494,981
- Positive
- Odd
- Prime
- 7 digits
2,494,981 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value2,494,981
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 factorisation2,494,981
Distinct prime factors12,494,981
Number of divisors2
Sum of divisors σ(n)2,494,982
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,494,980integers below n that share no factor with it
Carmichael function λ(n)2,494,980the 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,494,9812 in total
Arithmetic
Previous number2,494,980
Next number2,494,982
Double4,989,962
Half1,247,490.5
Square6,224,930,190,361
Cube15,531,082,551,277,078,141
Square root1,579.550885537≈irrational, shown to 9 decimal places
Cube root135.629995569≈
Negation-2,494,981
Reciprocal4.00804655 × 10^-7≈
Representations
Decimal2,494,981
Binary100110000100100000010122 bits
Octal11411005
Hexadecimal261205
Base 361HH51
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, four hundred and ninety-four thousand, nine hundred and eighty-one
Ordinaltwo million, four hundred and ninety-four thousand, nine hundred and eighty-first
Scientific notation2.494981 × 10^6
Engineering notation2.494981 × 10^6
In other bases
Ternary11200202110201base 3; the most digit-efficient integer base after e: 14 digits
Quinary1114314411base 5; one hand: 10 digits
Septenary30130666base 7: 8 digits
Nonary4622421base 9; each digit is two ternary digits: 7 digits
Duodecimala03a31base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalfbh91base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal11:33:3:1base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TTT01T1T111T01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11110100001011000000101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001001100001001000000101
Bit length22 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits15within that length
Bit parityodd7 set bits, so odd; 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 12 05
Gray code1101010001101100000111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001001100001001000000101
64-bit0000000000000000000000000000000000000000001001100001001000000101
One's complement11111111110110011110110111111010at 32 bits, every bit flipped
Bits reversed10100000010010000110010000000000at 32 bits
Rotated left by 100000000010011000010010000001010at 32 bits, wrapping
Shifted left by 110011000010010000001010= 4,989,962, no wrap
Shifted right by 1100110000100100000010= 1,247,490, discarding the low bit
These bits as a double1.2326844 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,494,981 to the power 26,224,930,190,361
2,494,981 to the power 315,531,082,551,277,078,141
2,494,981 to the power 438,749,755,874,867,835,697,310,321
2,494,981 to the power 596,679,904,662,433,627,575,911,001,998,901
First ten multiples2,494,981, 4,989,962, 7,484,943, 9,979,924, 12,474,905, 14,969,886, 17,464,867, 19,959,848, 22,454,829, 24,949,810
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 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 6
Divisible by 8No, remainder 5
Divisible by 9No, remainder 1
Divisible by 10No, remainder 1
Divisible by 11No, remainder 5
Divisible by 12No, remainder 1
Divisible by 100No, remainder 81
Collatz (3n + 1) trajectory
Steps to reach 1135the total stopping time
Highest value reached7,484,9443× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,494,981 → 7,484,944 → 3,742,472 → 1,871,236 → 935,618 → 467,809 → 1,403,428 → 701,714 → 350,857 → 1,052,572 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage249,498,100%
2,494,981% as a decimal24,949.81
2,494,981% of 1002,494,981
2,494,981% of 1,00024,949,810
As a fraction of 1002,494,981/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,494,981
Nerdulate something else
Nothing in mind? Surprise me · today’s page