Recognised as Number
1,532,500
- Positive
- Even
- Composite
- 7 digits
1,532,500 is an even 7-digit integer and a composite number. It has 30 divisors and a digital root of 7.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,532,500
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 × 5^4 × 613
Distinct prime factors32, 5, 613
Number of divisors30
Sum of divisors σ(n)3,356,738
Aliquot sum1,824,238sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)612,000integers below n that share no factor with it
Carmichael function λ(n)76,500the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 612,000
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, 613, 625, 1,226, 1,250, 2,452, 2,500, 3,065, 6,130, 12,260, 15,325, 30,650, 61,300, 76,625, 153,250, 306,500, 383,125, 766,250, 1,532,50030 in total
Arithmetic
Previous number1,532,499
Next number1,532,501
Double3,065,000
Half766,250
Square2,348,556,250,000
Cube3,599,162,453,125,000,000
Square root1,237.941840314≈irrational, shown to 9 decimal places
Cube root115.292262283≈
Negation-1,532,500
Reciprocal6.52528548 × 10^-7≈
Representations
Decimal1,532,500
Binary10111011000100101010021 bits
Octal5661124
Hexadecimal176254
Base 36WUHG
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, five hundred and thirty-two thousand, five hundred
Ordinalone million, five hundred and thirty-two thousand, five hundredth
Scientific notation1.5325 × 10^6
Engineering notation1.5325 × 10^6
In other bases
Ternary2212212012021base 3; the most digit-efficient integer base after e: 13 digits
Quinary343020000base 5; one hand: 9 digits
Septenary16011634base 7: 8 digits
Nonary2785167base 9; each digit is two ternary digits: 7 digits
Duodecimal61aa44base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal9bb50base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal7:5:41:40base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary100T00TT1TT1T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010001010011001010100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101110110001001010100
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 22 trailing zeros
Power of twoNo
Bytes317 62 54
Gray code111001101001101111110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101110110001001010100
64-bit0000000000000000000000000000000000000000000101110110001001010100
One's complement11111111111010001001110110101011at 32 bits, every bit flipped
Bits reversed00101010010001101110100000000000at 32 bits
Rotated left by 100000000001011101100010010101000at 32 bits, wrapping
Shifted left by 11011101100010010101000= 3,065,000, no wrap
Shifted right by 110111011000100101010= 766,250, discarding the low bit
These bits as a double7.57155602 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,532,500 to the power 22,348,556,250,000
1,532,500 to the power 33,599,162,453,125,000,000
1,532,500 to the power 45,515,716,459,414,062,500,000,000
1,532,500 to the power 58,452,835,474,052,050,781,250,000,000,000
First ten multiples1,532,500, 3,065,000, 4,597,500, 6,130,000, 7,662,500, 9,195,000, 10,727,500, 12,260,000, 13,792,500, 15,325,000
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 4
Divisible by 8No, remainder 4
Divisible by 9No, remainder 7
Divisible by 10Yes
Divisible by 11No, remainder 2
Divisible by 12No, remainder 4
Divisible by 100Yes
Collatz (3n + 1) trajectory
Steps to reach 1101the total stopping time
Highest value reached1,532,500
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,532,500 → 766,250 → 383,125 → 1,149,376 → 574,688 → 287,344 → 143,672 → 71,836 → 35,918 → 17,959 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage153,250,000%
1,532,500% as a decimal15,325
1,532,500% of 1001,532,500
1,532,500% of 1,00015,325,000
As a fraction of 1001,532,500/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,532,500
Nerdulate something else
Nothing in mind? Surprise me · today’s page