Recognised as Number
1,531,382
- Positive
- Even
- Composite
- 7 digits
1,531,382 is an even 7-digit integer and a composite number. It has 8 divisors and a digital root of 5.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,531,382
Digit count7
Digit sum23
Digit product720
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 53 × 14,447
Distinct prime factors32, 53, 14,447
Number of divisors8
Sum of divisors σ(n)2,340,576
Aliquot sum809,194sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)751,192integers below n that share no factor with it
Carmichael function λ(n)375,596the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 751,192
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 53, 106, 14,447, 28,894, 765,691, 1,531,3828 in total
Arithmetic
Previous number1,531,381
Next number1,531,383
Double3,062,764
Half765,691
Square2,345,130,829,924
Cube3,591,291,140,590,674,968
Square root1,237.490201981≈irrational, shown to 9 decimal places
Cube root115.264219193≈
Negation-1,531,382
Reciprocal6.53004933 × 10^-7≈
Representations
Decimal1,531,382
Binary10111010111011111011021 bits
Octal5656766
Hexadecimal175DF6
Base 36WTME
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, five hundred and thirty-one thousand, three hundred and eighty-two
Ordinalone million, five hundred and thirty-one thousand, three hundred and eighty-second
Scientific notation1.531382 × 10^6
Engineering notation1.531382 × 10^6
In other bases
Ternary2212210122212base 3; the most digit-efficient integer base after e: 13 digits
Quinary343001012base 5; one hand: 9 digits
Septenary16005446base 7: 8 digits
Nonary2783585base 9; each digit is two ternary digits: 7 digits
Duodecimal61a272base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal9b892base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal7:5:23:2base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary100T0T11T000TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010001010001000001010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101110101110111110110
Bit length21 bitsto write the magnitude
Set bits15the population count, or Hamming weight
Zero bits6within that length
Bit parityodd15 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
Bytes317 5d f6
Gray code111001111001100001101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101110101110111110110
64-bit0000000000000000000000000000000000000000000101110101110111110110
One's complement11111111111010001010001000001001at 32 bits, every bit flipped
Bits reversed01101111101110101110100000000000at 32 bits
Rotated left by 100000000001011101011101111101100at 32 bits, wrapping
Shifted left by 11011101011101111101100= 3,062,764, no wrap
Shifted right by 110111010111011111011= 765,691, discarding the low bit
These bits as a double7.56603237 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,531,382 to the power 22,345,130,829,924
1,531,382 to the power 33,591,291,140,590,674,968
1,531,382 to the power 45,499,638,609,460,029,013,845,776
1,531,382 to the power 58,422,047,573,032,118,151,281,172,142,432
First ten multiples1,531,382, 3,062,764, 4,594,146, 6,125,528, 7,656,910, 9,188,292, 10,719,674, 12,251,056, 13,782,438, 15,313,820
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4No, remainder 2
Divisible by 5No, remainder 2
Divisible by 6No, remainder 2
Divisible by 7No, remainder 6
Divisible by 8No, remainder 6
Divisible by 9No, remainder 5
Divisible by 10No, remainder 2
Divisible by 11No, remainder 6
Divisible by 12No, remainder 2
Divisible by 100No, remainder 82
Collatz (3n + 1) trajectory
Steps to reach 1119the total stopping time
Highest value reached17,681,48811× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,531,382 → 765,691 → 2,297,074 → 1,148,537 → 3,445,612 → 1,722,806 → 861,403 → 2,584,210 → 1,292,105 → 3,876,316 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage153,138,200%
1,531,382% as a decimal15,313.82
1,531,382% of 1001,531,382
1,531,382% of 1,00015,313,820
As a fraction of 1001,531,382/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,531,382
Nerdulate something else
Nothing in mind? Surprise me · today’s page