Recognised as Number
1,502,082
- Positive
- Even
- Composite
- 7 digits
1,502,082 is an even 7-digit integer and a composite number. It has 12 divisors and a digital root of 9.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,502,082
Digit count7
Digit sum18
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberYesdivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 3^2 × 83,449
Distinct prime factors32, 3, 83,449
Number of divisors12
Sum of divisors σ(n)3,254,550
Aliquot sum1,752,468sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)500,688integers below n that share no factor with it
Carmichael function λ(n)83,448the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 500,688
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 6, 9, 18, 83,449, 166,898, 250,347, 500,694, 751,041, 1,502,08212 in total
Arithmetic
Previous number1,502,081
Next number1,502,083
Double3,004,164
Half751,041
Square2,256,250,334,724
Cube3,389,073,015,282,895,368
Square root1,225.594549596≈irrational, shown to 9 decimal places
Cube root114.524361883≈
Negation-1,502,082
Reciprocal6.65742616 × 10^-7≈
Representations
Decimal1,502,082
Binary10110111010111000001021 bits
Octal5565602
Hexadecimal16EB82
Base 36W70I
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, five hundred and two thousand and eighty-two
Ordinalone million, five hundred and two thousand and eighty-second
Scientific notation1.502082 × 10^6
Engineering notation1.502082 × 10^6
In other bases
Ternary2211022110200base 3; the most digit-efficient integer base after e: 13 digits
Quinary341031312base 5; one hand: 9 digits
Septenary15524151base 7: 8 digits
Nonary2738420base 9; each digit is two ternary digits: 7 digits
Duodecimal605316base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal97f42base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:57:14:42base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T1110T111T00digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010110011110010000110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101101110101110000010
Bit length21 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits10within that length
Bit parityodd11 set bits, so odd; not the same as the number itself being even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes316 eb 82
Gray code111011001111001000011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101101110101110000010
64-bit0000000000000000000000000000000000000000000101101110101110000010
One's complement11111111111010010001010001111101at 32 bits, every bit flipped
Bits reversed01000001110101110110100000000000at 32 bits
Rotated left by 100000000001011011101011100000100at 32 bits, wrapping
Shifted left by 11011011101011100000100= 3,004,164, no wrap
Shifted right by 110110111010111000001= 751,041, discarding the low bit
These bits as a double7.42127113 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,502,082 to the power 22,256,250,334,724
1,502,082 to the power 33,389,073,015,282,895,368
1,502,082 to the power 45,090,665,572,942,162,040,156,176
1,502,082 to the power 57,646,597,125,136,108,641,601,869,158,432
First ten multiples1,502,082, 3,004,164, 4,506,246, 6,008,328, 7,510,410, 9,012,492, 10,514,574, 12,016,656, 13,518,738, 15,020,820
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4No, remainder 2
Divisible by 5No, remainder 2
Divisible by 6Yes
Divisible by 7No, remainder 1
Divisible by 8No, remainder 2
Divisible by 9Yes
Divisible by 10No, remainder 2
Divisible by 11No, remainder 10
Divisible by 12No, remainder 6
Divisible by 100No, remainder 82
Collatz (3n + 1) trajectory
Steps to reach 1163the total stopping time
Highest value reached2,253,1241× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,502,082 → 751,041 → 2,253,124 → 1,126,562 → 563,281 → 1,689,844 → 844,922 → 422,461 → 1,267,384 → 633,692 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage150,208,200%
1,502,082% as a decimal15,020.82
1,502,082% of 1001,502,082
1,502,082% of 1,00015,020,820
As a fraction of 1001,502,082/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,082
Nerdulate something else
Nothing in mind? Surprise me · today’s page