Recognised as Number

2,501,509

Positive
Odd
Composite
7 digits

2,501,509 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 4.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value2,501,509

Digit count7

Digit sum22

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times the digit product can be taken before one digit is left

Digital root4repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation523 × 4,783

Distinct prime factors2523, 4,783

Number of divisors4

Sum of divisors σ(n)2,506,816

Aliquot sum5,307sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)2,496,204integers below n that share no factor with it

Carmichael function λ(n)416,034the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,496,204

Möbius function μ(n)+12 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 523, 4,783, 2,501,5094 in total

Arithmetic

Previous number2,501,508

Next number2,501,510

Double5,003,018

Half1,250,754.5

Square6,257,547,277,081

Cube15,653,310,831,543,615,229

Square root1,581.615945797≈irrational, shown to 9 decimal places

Cube root135.748182379≈

Negation-2,501,509

Reciprocal3.99758706 × 10^-7≈

Representations

Decimal2,501,509

Binary100110001010111000010122 bits

Octal11425605

Hexadecimal262B85

Base 361HM6D

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordstwo million, five hundred and one thousand, five hundred and nine

Ordinaltwo million, five hundred and one thousand, five hundred and ninth

Scientific notation2.501509 × 10^6

Engineering notation2.501509 × 10^6

In other bases

Ternary11201002102111base 3; the most digit-efficient integer base after e: 14 digits

Quinary1120022014base 5; one hand: 10 digits

Septenary30156013base 7: 8 digits

Nonary4632374base 9; each digit is two ternary digits: 7 digits

Duodecimala07771base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits

Vigesimalfcdf9base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits

Sexagesimal11:34:51:49base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

Balanced ternary1TTT0101T11T111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary11110100111110010000101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000001001100010101110000101

Bit length22 bitsto write the magnitude

Set bits10the population count, or Hamming weight

Zero bits12within that length

Bit parityeven10 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 2b 85

Gray code1101010011111001000111n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000001001100010101110000101

64-bit0000000000000000000000000000000000000000001001100010101110000101

One's complement11111111110110011101010001111010at 32 bits, every bit flipped

Bits reversed10100001110101000110010000000000at 32 bits

Rotated left by 100000000010011000101011100001010at 32 bits, wrapping

Shifted left by 110011000101011100001010= 5,003,018, no wrap

Shifted right by 1100110001010111000010= 1,250,754, discarding the low bit

These bits as a double1.23590966 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2,501,563+54

Previous prime2,501,507−2

Distance to nearest prime2

Nearest square below2,499,561

Nearest square above2,502,724

Powers & multiples

2,501,509 to the power 26,257,547,277,081

2,501,509 to the power 315,653,310,831,543,615,229

2,501,509 to the power 439,156,897,924,903,837,387,880,561

2,501,509 to the power 597,951,332,571,228,273,360,319,714,266,549

First ten multiples2,501,509, 5,003,018, 7,504,527, 10,006,036, 12,507,545, 15,009,054, 17,510,563, 20,012,072, 22,513,581, 25,015,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 3

Divisible by 8No, remainder 5

Divisible by 9No, remainder 4

Divisible by 10No, remainder 9

Divisible by 11No, remainder 10

Divisible by 12No, remainder 1

Divisible by 100No, remainder 9

Collatz (3n + 1) trajectory

Steps to reach 1174the total stopping time

Highest value reached7,504,5283× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps2,501,509 → 7,504,528 → 3,752,264 → 1,876,132 → 938,066 → 469,033 → 1,407,100 → 703,550 → 351,775 → 1,055,326 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage250,150,900%

2,501,509% as a decimal25,015.09

2,501,509% of 1002,501,509

2,501,509% of 1,00025,015,090

As a fraction of 1002,501,509/100

Read another way

As seconds28 days, 22 hours and 51 minutes

As bytes2.386 MiB

As a 24-bit colour#262B85

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.