Recognised as Number
2,015,332
- Positive
- Even
- Composite
- 7 digits
2,015,332 is an even 7-digit integer and a composite number. It has 24 divisors and a digital root of 7.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value2,015,332
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 numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^2 × 11 × 163 × 281
Distinct prime factors42, 11, 163, 281
Number of divisors24
Sum of divisors σ(n)3,884,832
Aliquot sum1,869,500sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)907,200integers below n that share no factor with it
Carmichael function λ(n)22,680the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 907,200
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 11, 22, 44, 163, 281, 326, 562, 652, 1,124, 1,793, 3,091, 3,586, 6,182, 7,172, 12,364, 45,803, 91,606, 183,212, 503,833, 1,007,666, 2,015,33224 in total
Arithmetic
Previous number2,015,331
Next number2,015,333
Double4,030,664
Half1,007,666
Square4,061,563,070,224
Cube8,185,398,025,440,674,368
Square root1,419.623893854≈irrational, shown to 9 decimal places
Cube root126.313237607≈
Negation-2,015,332
Reciprocal4.9619616 × 10^-7≈
Representations
Decimal2,015,332
Binary11110110000000110010021 bits
Octal7540144
Hexadecimal1EC064
Base 361771G
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, fifteen thousand, three hundred and thirty-two
Ordinaltwo million, fifteen thousand, three hundred and thirty-second
Scientific notation2.015332 × 10^6
Engineering notation2.015332 × 10^6
In other bases
Ternary10210101111221base 3; the most digit-efficient integer base after e: 14 digits
Quinary1003442312base 5; one hand: 10 digits
Septenary23062414base 7: 8 digits
Nonary3711457base 9; each digit is two ternary digits: 7 digits
Duodecimal812344base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalcbi6cbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal9:19:48:52base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11T1011TTTT0T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000111100000110100100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000111101100000001100100
Bit length21 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits12within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes31e c0 64
Gray code100011010000001010110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000111101100000001100100
64-bit0000000000000000000000000000000000000000000111101100000001100100
One's complement11111111111000010011111110011011at 32 bits, every bit flipped
Bits reversed00100110000000110111100000000000at 32 bits
Rotated left by 100000000001111011000000011001000at 32 bits, wrapping
Shifted left by 11111011000000011001000= 4,030,664, no wrap
Shifted right by 111110110000000110010= 1,007,666, discarding the low bit
These bits as a double9.95706306 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,015,332 to the power 24,061,563,070,224
2,015,332 to the power 38,185,398,025,440,674,368
2,015,332 to the power 416,496,294,573,407,405,155,410,176
2,015,332 to the power 533,245,510,335,214,292,646,663,100,818,432
First ten multiples2,015,332, 4,030,664, 6,045,996, 8,061,328, 10,076,660, 12,091,992, 14,107,324, 16,122,656, 18,137,988, 20,153,320
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 5No, remainder 2
Divisible by 6No, remainder 4
Divisible by 7No, remainder 4
Divisible by 8No, remainder 4
Divisible by 9No, remainder 7
Divisible by 10No, remainder 2
Divisible by 11Yes
Divisible by 12No, remainder 4
Divisible by 100No, remainder 32
Collatz (3n + 1) trajectory
Steps to reach 191the total stopping time
Highest value reached2,015,332
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,015,332 → 1,007,666 → 503,833 → 1,511,500 → 755,750 → 377,875 → 1,133,626 → 566,813 → 1,700,440 → 850,220 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage201,533,200%
2,015,332% as a decimal20,153.32
2,015,332% of 1002,015,332
2,015,332% of 1,00020,153,320
As a fraction of 1002,015,332/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,015,332
Nerdulate something else
Nothing in mind? Surprise me · today’s page