Recognised as Number
1,532,648
- Positive
- Even
- Composite
- 7 digits
1,532,648 is an even 7-digit integer and a composite number. It has 16 divisors and a digital root of 2.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,532,648
Digit count7
Digit sum29
Digit product5,760
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^3 × 13 × 14,737
Distinct prime factors32, 13, 14,737
Number of divisors16
Sum of divisors σ(n)3,094,980
Aliquot sum1,562,332sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)707,328integers below n that share no factor with it
Carmichael function λ(n)14,736the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 707,328
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 13, 26, 52, 104, 14,737, 29,474, 58,948, 117,896, 191,581, 383,162, 766,324, 1,532,64816 in total
Arithmetic
Previous number1,532,647
Next number1,532,649
Double3,065,296
Half766,324
Square2,349,009,891,904
Cube3,600,205,312,806,881,792
Square root1,238.001615508≈irrational, shown to 9 decimal places
Cube root115.295973584≈
Negation-1,532,648
Reciprocal6.52465537 × 10^-7≈
Representations
Decimal1,532,648
Binary10111011000101110100021 bits
Octal5661350
Hexadecimal1762E8
Base 36WULK
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, five hundred and thirty-two thousand, six hundred and forty-eight
Ordinalone million, five hundred and thirty-two thousand, six hundred and forty-eighth
Scientific notation1.532648 × 10^6
Engineering notation1.532648 × 10^6
In other bases
Ternary2212212101202base 3; the most digit-efficient integer base after e: 13 digits
Quinary343021043base 5; one hand: 9 digits
Septenary16012235base 7: 8 digits
Nonary2785352base 9; each digit is two ternary digits: 7 digits
Duodecimal61ab48base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal9bbc8base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal7:5:44:8base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary100T00TT11TT1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010001010011100111000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101110110001011101000
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 33 trailing zeros
Power of twoNo
Bytes317 62 e8
Gray code111001101001110011100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101110110001011101000
64-bit0000000000000000000000000000000000000000000101110110001011101000
One's complement11111111111010001001110100010111at 32 bits, every bit flipped
Bits reversed00010111010001101110100000000000at 32 bits
Rotated left by 100000000001011101100010111010000at 32 bits, wrapping
Shifted left by 11011101100010111010000= 3,065,296, no wrap
Shifted right by 110111011000101110100= 766,324, discarding the low bit
These bits as a double7.57228724 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,532,648 to the power 22,349,009,891,904
1,532,648 to the power 33,600,205,312,806,881,792
1,532,648 to the power 45,517,847,472,262,841,764,745,216
1,532,648 to the power 58,456,917,892,668,699,905,053,225,811,968
First ten multiples1,532,648, 3,065,296, 4,597,944, 6,130,592, 7,663,240, 9,195,888, 10,728,536, 12,261,184, 13,793,832, 15,326,480
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 4Yes
Divisible by 5No, remainder 3
Divisible by 6No, remainder 2
Divisible by 7No, remainder 5
Divisible by 8Yes
Divisible by 9No, remainder 2
Divisible by 10No, remainder 8
Divisible by 11No, remainder 7
Divisible by 12No, remainder 8
Divisible by 100No, remainder 48
Collatz (3n + 1) trajectory
Steps to reach 1101the total stopping time
Highest value reached1,532,648
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,532,648 → 766,324 → 383,162 → 191,581 → 574,744 → 287,372 → 143,686 → 71,843 → 215,530 → 107,765 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage153,264,800%
1,532,648% as a decimal15,326.48
1,532,648% of 1001,532,648
1,532,648% of 1,00015,326,480
As a fraction of 1001,532,648/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,648
Nerdulate something else
Nothing in mind? Surprise me · today’s page