Recognised as Number
1,502,080
- Positive
- Even
- Composite
- 7 digits
1,502,080 is an even 7-digit integer and a composite number. It has 32 divisors and a digital root of 7.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,502,080
Digit count7
Digit sum16
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 numberYessquared-digit sums reach 1
Harshad numberYesdivisible by its own digit sum
Factors & divisors
Prime factorisation2^7 × 5 × 2,347
Distinct prime factors32, 5, 2,347
Number of divisors32
Sum of divisors σ(n)3,592,440
Aliquot sum2,090,360sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)600,576integers below n that share no factor with it
Carmichael function λ(n)37,536the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 600,576
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 5, 8, 10, 16, 20, 32, 40, 64, 80, 128, 160, 320, 640, 2,347, 4,694, 9,388, 11,735, 18,776, 23,470, 37,552, 46,940, 75,104, 93,880, 150,208, 187,760, 300,416, 375,520, 751,040, 1,502,08032 in total
Arithmetic
Previous number1,502,079
Next number1,502,081
Double3,004,160
Half751,040
Square2,256,244,326,400
Cube3,389,059,477,798,912,000
Square root1,225.593733665≈irrational, shown to 9 decimal places
Cube root114.524311054≈
Negation-1,502,080
Reciprocal6.65743502 × 10^-7≈
Representations
Decimal1,502,080
Binary10110111010111000000021 bits
Octal5565600
Hexadecimal16EB80
Base 36W70G
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, five hundred and two thousand and eighty
Ordinalone million, five hundred and two thousand and eightieth
Scientific notation1.50208 × 10^6
Engineering notation1.50208 × 10^6
In other bases
Ternary2211022110121base 3; the most digit-efficient integer base after e: 13 digits
Quinary341031310base 5; one hand: 9 digits
Septenary15524146base 7: 8 digits
Nonary2738417base 9; each digit is two ternary digits: 7 digits
Duodecimal605314base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal97f40base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:57:14:40base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T1110T111TT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010110011110010000000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101101110101110000000
Bit length21 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits11within that length
Bit parityeven10 set bits, so even; not the same as the number itself being even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 77 trailing zeros
Power of twoNo
Bytes316 eb 80
Gray code111011001111001000000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101101110101110000000
64-bit0000000000000000000000000000000000000000000101101110101110000000
One's complement11111111111010010001010001111111at 32 bits, every bit flipped
Bits reversed00000001110101110110100000000000at 32 bits
Rotated left by 100000000001011011101011100000000at 32 bits, wrapping
Shifted left by 11011011101011100000000= 3,004,160, no wrap
Shifted right by 110110111010111000000= 751,040, discarding the low bit
These bits as a double7.42126125 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,502,080 to the power 22,256,244,326,400
1,502,080 to the power 33,389,059,477,798,912,000
1,502,080 to the power 45,090,638,460,412,189,736,960,000
1,502,080 to the power 57,646,546,218,615,941,960,092,876,800,000
First ten multiples1,502,080, 3,004,160, 4,506,240, 6,008,320, 7,510,400, 9,012,480, 10,514,560, 12,016,640, 13,518,720, 15,020,800
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
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 6
Divisible by 8Yes
Divisible by 9No, remainder 7
Divisible by 10Yes
Divisible by 11No, remainder 8
Divisible by 12No, remainder 4
Divisible by 100No, remainder 80
Collatz (3n + 1) trajectory
Steps to reach 188the total stopping time
Highest value reached1,502,080
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,502,080 → 751,040 → 375,520 → 187,760 → 93,880 → 46,940 → 23,470 → 11,735 → 35,206 → 17,603 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage150,208,000%
1,502,080% as a decimal15,020.8
1,502,080% of 1001,502,080
1,502,080% of 1,00015,020,800
As a fraction of 1001,502,080/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 1,502,080
Nerdulate something else
Nothing in mind? Surprise me · today’s page