Recognised as Number
2,490,101
- Positive
- Odd
- Prime
- 7 digits
2,490,101 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,490,101
Digit count7
Digit sum17
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2,490,101
Distinct prime factors12,490,101
Number of divisors2
Sum of divisors σ(n)2,490,102
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,490,100integers below n that share no factor with it
Carmichael function λ(n)2,490,100the 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,490,1012 in total
Arithmetic
Previous number2,490,100
Next number2,490,102
Double4,980,202
Half1,245,050.5
Square6,200,602,990,201
Cube15,440,127,706,502,500,301
Square root1,578.005386556≈irrational, shown to 9 decimal places
Cube root135.541510409≈
Negation-2,490,101
Reciprocal4.01590136 × 10^-7≈
Representations
Decimal2,490,101
Binary100101111111101111010122 bits
Octal11377365
Hexadecimal25FEF5
Base 361HDDH
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, four hundred and ninety thousand, one hundred and one
Ordinaltwo million, four hundred and ninety thousand, one hundred and first
Scientific notation2.490101 × 10^6
Engineering notation2.490101 × 10^6
In other bases
Ternary11200111202222base 3; the most digit-efficient integer base after e: 14 digits
Quinary1114140401base 5; one hand: 10 digits
Septenary30110525base 7: 8 digits
Nonary4614688base 9; each digit is two ternary digits: 7 digits
Duodecimala01045base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalfb551base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal11:31:41:41base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TTT01TTTT1000Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11110100000001100110101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001001011111111011110101
Bit length22 bitsto write the magnitude
Set bits16the population count, or Hamming weight
Zero bits6within that length
Bit parityeven16 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 fe f5
Gray code1101110000000110001111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001001011111111011110101
64-bit0000000000000000000000000000000000000000001001011111111011110101
One's complement11111111110110100000000100001010at 32 bits, every bit flipped
Bits reversed10101111011111111010010000000000at 32 bits
Rotated left by 100000000010010111111110111101010at 32 bits, wrapping
Shifted left by 110010111111110111101010= 4,980,202, no wrap
Shifted right by 1100101111111101111010= 1,245,050, discarding the low bit
These bits as a double1.23027336 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,490,101 to the power 26,200,602,990,201
2,490,101 to the power 315,440,127,706,502,500,301
2,490,101 to the power 438,447,477,442,089,582,502,020,401
2,490,101 to the power 595,738,102,026,024,711,477,863,502,550,501
First ten multiples2,490,101, 4,980,202, 7,470,303, 9,960,404, 12,450,505, 14,940,606, 17,430,707, 19,920,808, 22,410,909, 24,901,010
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 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 5
Divisible by 8No, remainder 5
Divisible by 9No, remainder 8
Divisible by 10No, remainder 1
Divisible by 11No, remainder 9
Divisible by 12No, remainder 5
Divisible by 100No, remainder 1
Collatz (3n + 1) trajectory
Steps to reach 1112the total stopping time
Highest value reached7,470,3043× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,490,101 → 7,470,304 → 3,735,152 → 1,867,576 → 933,788 → 466,894 → 233,447 → 700,342 → 350,171 → 1,050,514 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage249,010,100%
2,490,101% as a decimal24,901.01
2,490,101% of 1002,490,101
2,490,101% of 1,00024,901,010
As a fraction of 1002,490,101/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,101
Nerdulate something else
Nothing in mind? Surprise me · today’s page