Recognised as Number
3,501,532
- Positive
- Even
- Composite
- 7 digits
3,501,532 is an even 7-digit integer and a composite number. It has 24 divisors and a digital root of 1.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value3,501,532
Digit count7
Digit sum19
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^2 × 37 × 59 × 401
Distinct prime factors42, 37, 59, 401
Number of divisors24
Sum of divisors σ(n)6,415,920
Aliquot sum2,914,388sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,670,400integers below n that share no factor with it
Carmichael function λ(n)104,400the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,670,400
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 37, 59, 74, 118, 148, 236, 401, 802, 1,604, 2,183, 4,366, 8,732, 14,837, 23,659, 29,674, 47,318, 59,348, 94,636, 875,383, 1,750,766, 3,501,53224 in total
Arithmetic
Previous number3,501,531
Next number3,501,533
Double7,003,064
Half1,750,766
Square12,260,726,347,024
Cube42,931,325,647,347,640,768
Square root1,871.238092814≈irrational, shown to 9 decimal places
Cube root151.851598002≈
Negation-3,501,532
Reciprocal2.85589279 × 10^-7≈
Representations
Decimal3,501,532
Binary110101011011011101110022 bits
Octal15266734
Hexadecimal356DDC
Base 36231SS
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, five hundred and one thousand, five hundred and thirty-two
Ordinalthree million, five hundred and one thousand, five hundred and thirty-second
Scientific notation3.501532 × 10^6
Engineering notation3.501532 × 10^6
In other bases
Ternary20120220012101base 3; the most digit-efficient integer base after e: 14 digits
Quinary1344022112base 5; one hand: 10 digits
Septenary41522356base 7: 8 digits
Nonary6526171base 9; each digit is two ternary digits: 7 digits
Duodecimal120a424base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal11hdgcbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:12:38:52base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1TT10T01TT101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010101011001000101100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101010110110111011100
Bit length22 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits8within that length
Bit parityeven14 set bits, so even; not the same as the number itself being even
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes335 6d dc
Gray code1011111101101100110010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101010110110111011100
64-bit0000000000000000000000000000000000000000001101010110110111011100
One's complement11111111110010101001001000100011at 32 bits, every bit flipped
Bits reversed00111011101101101010110000000000at 32 bits
Rotated left by 100000000011010101101101110111000at 32 bits, wrapping
Shifted left by 111010101101101110111000= 7,003,064, no wrap
Shifted right by 1110101011011011101110= 1,750,766, discarding the low bit
These bits as a double1.72998667 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,501,532 to the power 212,260,726,347,024
3,501,532 to the power 342,931,325,647,347,640,768
3,501,532 to the power 4150,325,410,556,608,479,273,656,576
3,501,532 to the power 5526,369,235,477,102,401,648,045,257,874,432
First ten multiples3,501,532, 7,003,064, 10,504,596, 14,006,128, 17,507,660, 21,009,192, 24,510,724, 28,012,256, 31,513,788, 35,015,320
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
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 6
Divisible by 8No, remainder 4
Divisible by 9No, remainder 1
Divisible by 10No, remainder 2
Divisible by 11No, remainder 1
Divisible by 12No, remainder 4
Divisible by 100No, remainder 32
Collatz (3n + 1) trajectory
Steps to reach 1190the total stopping time
Highest value reached5,908,8401× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,501,532 → 1,750,766 → 875,383 → 2,626,150 → 1,313,075 → 3,939,226 → 1,969,613 → 5,908,840 → 2,954,420 → 1,477,210 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage350,153,200%
3,501,532% as a decimal35,015.32
3,501,532% of 1003,501,532
3,501,532% of 1,00035,015,320
As a fraction of 1003,501,532/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 3,501,532
Nerdulate something else
Nothing in mind? Surprise me · today’s page