Recognised as Number

2,501,500

Positive
Even
Composite
7 digits

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

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value2,501,500

Digit count7

Digit sum13

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 factorisation2^2 × 5^3 × 5,003

Distinct prime factors32, 5, 5,003

Number of divisors24

Sum of divisors σ(n)5,464,368

Aliquot sum2,962,868sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

Euler's totient φ(n)1,000,400integers below n that share no factor with it

Carmichael function λ(n)250,100the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,000,400

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 2, 4, 5, 10, 20, 25, 50, 100, 125, 250, 500, 5,003, 10,006, 20,012, 25,015, 50,030, 100,060, 125,075, 250,150, 500,300, 625,375, 1,250,750, 2,501,50024 in total

Arithmetic

Previous number2,501,499

Next number2,501,501

Double5,003,000

Half1,250,750

Square6,257,502,250,000

Cube15,653,141,878,375,000,000

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

Cube root135.748019579≈

Negation-2,501,500

Reciprocal3.99760144 × 10^-7≈

Representations

Decimal2,501,500

Binary100110001010110111110022 bits

Octal11425574

Hexadecimal262B7C

Base 361HM64

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

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

Ordinaltwo million, five hundred and one thousand, five hundredth

Scientific notation2.5015 × 10^6

Engineering notation2.5015 × 10^6

In other bases

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

Quinary1120022000base 5; one hand: 10 digits

Septenary30156001base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000001001100010101101111100

Bit length22 bitsto write the magnitude

Set bits12the population count, or Hamming weight

Zero bits10within that length

Bit parityeven12 set bits, so even; not the same as the number itself being even

Highest set bitbit 21worth 2,097,152

Lowest set bitbit 22 trailing zeros

Power of twoNo

Bytes326 2b 7c

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

At each machine width

32-bit00000000001001100010101101111100

64-bit0000000000000000000000000000000000000000001001100010101101111100

One's complement11111111110110011101010010000011at 32 bits, every bit flipped

Bits reversed00111110110101000110010000000000at 32 bits

Rotated left by 100000000010011000101011011111000at 32 bits, wrapping

Shifted left by 110011000101011011111000= 5,003,000, no wrap

Shifted right by 1100110001010110111110= 1,250,750, discarding the low bit

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

Nearest landmarks

Next prime2,501,501+1

Previous prime2,501,489−11

Distance to nearest prime1

Nearest square below2,499,561

Nearest square above2,502,724

Powers & multiples

2,501,500 to the power 26,257,502,250,000

2,501,500 to the power 315,653,141,878,375,000,000

2,501,500 to the power 439,156,334,408,755,062,500,000,000

2,501,500 to the power 597,949,570,523,500,788,843,750,000,000,000

First ten multiples2,501,500, 5,003,000, 7,504,500, 10,006,000, 12,507,500, 15,009,000, 17,510,500, 20,012,000, 22,513,500, 25,015,000

Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 1

Divisible by 4Yes

Divisible by 5Yes

Divisible by 6No, remainder 4

Divisible by 7No, remainder 1

Divisible by 8No, remainder 4

Divisible by 9No, remainder 4

Divisible by 10Yes

Divisible by 11No, remainder 1

Divisible by 12No, remainder 4

Divisible by 100Yes

Collatz (3n + 1) trajectory

Steps to reach 181the total stopping time

Highest value reached9,497,8963× the starting value

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

First steps2,501,500 → 1,250,750 → 625,375 → 1,876,126 → 938,063 → 2,814,190 → 1,407,095 → 4,221,286 → 2,110,643 → 6,331,930 → …

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

As a percentage & fraction

As a percentage250,150,000%

2,501,500% as a decimal25,015

2,501,500% of 1002,501,500

2,501,500% of 1,00025,015,000

As a fraction of 1002,501,500/100

Read another way

As seconds28 days, 22 hours and 51 minutes

As bytes2.386 MiB

As a 24-bit colour#262B7C

Keep nerding

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