Recognised as Number
2,540,509
- Positive
- Odd
- Composite
- 7 digits
2,540,509 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value2,540,509
Digit count7
Digit sum25
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation19 × 133,711
Distinct prime factors219, 133,711
Number of divisors4
Sum of divisors σ(n)2,674,240
Aliquot sum133,731sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,406,780integers below n that share no factor with it
Carmichael function λ(n)401,130the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,406,780
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 19, 133,711, 2,540,5094 in total
Arithmetic
Previous number2,540,508
Next number2,540,510
Double5,081,018
Half1,270,254.5
Square6,454,185,979,081
Cube16,396,917,567,529,092,229
Square root1,593.897424554≈irrational, shown to 9 decimal places
Cube root136.450012333≈
Negation-2,540,509
Reciprocal3.93621908 × 10^-7≈
Representations
Decimal2,540,509
Binary100110110000111101110122 bits
Octal11541735
Hexadecimal26C3DD
Base 361IG9P
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, five hundred and forty thousand, five hundred and nine
Ordinaltwo million, five hundred and forty thousand, five hundred and ninth
Scientific notation2.540509 × 10^6
Engineering notation2.540509 × 10^6
In other bases
Ternary11210001220221base 3; the most digit-efficient integer base after e: 14 digits
Quinary1122244014base 5; one hand: 10 digits
Septenary30410506base 7: 8 digits
Nonary4701827base 9; each digit is two ternary digits: 7 digits
Duodecimala26251base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalfhb59base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal11:45:41:49base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TTT1001T0T10T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11110111100010000101101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001001101100001111011101
Bit length22 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits9within that length
Bit parityodd13 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 c3 dd
Gray code1101011010001000110011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001001101100001111011101
64-bit0000000000000000000000000000000000000000001001101100001111011101
One's complement11111111110110010011110000100010at 32 bits, every bit flipped
Bits reversed10111011110000110110010000000000at 32 bits
Rotated left by 100000000010011011000011110111010at 32 bits, wrapping
Shifted left by 110011011000011110111010= 5,081,018, no wrap
Shifted right by 1100110110000111101110= 1,270,254, discarding the low bit
These bits as a double1.25517822 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,540,509 to the power 26,454,185,979,081
2,540,509 to the power 316,396,917,567,529,092,229
2,540,509 to the power 441,656,516,652,565,766,569,604,561
2,540,509 to the power 5105,828,755,464,493,203,061,979,513,661,549
First ten multiples2,540,509, 5,081,018, 7,621,527, 10,162,036, 12,702,545, 15,243,054, 17,783,563, 20,324,072, 22,864,581, 25,405,090
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 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 6
Divisible by 8No, remainder 5
Divisible by 9No, remainder 7
Divisible by 10No, remainder 9
Divisible by 11No, remainder 4
Divisible by 12No, remainder 1
Divisible by 100No, remainder 9
Collatz (3n + 1) trajectory
Steps to reach 1130the total stopping time
Highest value reached7,621,5283× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,540,509 → 7,621,528 → 3,810,764 → 1,905,382 → 952,691 → 2,858,074 → 1,429,037 → 4,287,112 → 2,143,556 → 1,071,778 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage254,050,900%
2,540,509% as a decimal25,405.09
2,540,509% of 1002,540,509
2,540,509% of 1,00025,405,090
As a fraction of 1002,540,509/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,540,509
Nerdulate something else
Nothing in mind? Surprise me · today’s page