Recognised as Number
3,501,535
- Positive
- Odd
- Composite
- 7 digits
3,501,535 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,501,535
Digit count7
Digit sum22
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation5 × 700,307
Distinct prime factors25, 700,307
Number of divisors4
Sum of divisors σ(n)4,201,848
Aliquot sum700,313sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,801,224integers below n that share no factor with it
Carmichael function λ(n)1,400,612the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,801,224
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 5, 700,307, 3,501,5354 in total
Arithmetic
Previous number3,501,534
Next number3,501,536
Double7,003,070
Half1,750,767.5
Square12,260,747,356,225
Cube42,931,435,993,979,305,375
Square root1,871.238894423≈irrational, shown to 9 decimal places
Cube root151.851641369≈
Negation-3,501,535
Reciprocal2.85589035 × 10^-7≈
Representations
Decimal3,501,535
Binary110101011011011101111122 bits
Octal15266737
Hexadecimal356DDF
Base 36231SV
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, five hundred and one thousand, five hundred and thirty-five
Ordinalthree million, five hundred and one thousand, five hundred and thirty-fifth
Scientific notation3.501535 × 10^6
Engineering notation3.501535 × 10^6
In other bases
Ternary20120220012111base 3; the most digit-efficient integer base after e: 14 digits
Quinary1344022120base 5; one hand: 10 digits
Septenary41522362base 7: 8 digits
Nonary6526174base 9; each digit is two ternary digits: 7 digits
Duodecimal120a427base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal11hdgfbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:12:38:55base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1TT10T01TT111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010101011001000100011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101010110110111011111
Bit length22 bitsto write the magnitude
Set bits16the population count, or Hamming weight
Zero bits6within that length
Bit parityeven16 set bits, so even; not the same as the number itself being odd
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes335 6d df
Gray code1011111101101100110000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101010110110111011111
64-bit0000000000000000000000000000000000000000001101010110110111011111
One's complement11111111110010101001001000100000at 32 bits, every bit flipped
Bits reversed11111011101101101010110000000000at 32 bits
Rotated left by 100000000011010101101101110111110at 32 bits, wrapping
Shifted left by 111010101101101110111110= 7,003,070, no wrap
Shifted right by 1110101011011011101111= 1,750,767, discarding the low bit
These bits as a double1.72998815 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,501,535 to the power 212,260,747,356,225
3,501,535 to the power 342,931,435,993,979,305,375
3,501,535 to the power 4150,325,925,733,178,327,046,250,625
3,501,535 to the power 5526,371,490,362,124,573,393,893,182,209,375
First ten multiples3,501,535, 7,003,070, 10,504,605, 14,006,140, 17,507,675, 21,009,210, 24,510,745, 28,012,280, 31,513,815, 35,015,350
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 3
Divisible by 5Yes
Divisible by 6No, remainder 1
Divisible by 7No, remainder 2
Divisible by 8No, remainder 7
Divisible by 9No, remainder 4
Divisible by 10No, remainder 5
Divisible by 11No, remainder 4
Divisible by 12No, remainder 7
Divisible by 100No, remainder 35
Collatz (3n + 1) trajectory
Steps to reach 171the total stopping time
Highest value reached53,179,57615× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,501,535 → 10,504,606 → 5,252,303 → 15,756,910 → 7,878,455 → 23,635,366 → 11,817,683 → 35,453,050 → 17,726,525 → 53,179,576 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage350,153,500%
3,501,535% as a decimal35,015.35
3,501,535% of 1003,501,535
3,501,535% of 1,00035,015,350
As a fraction of 1003,501,535/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,535
Nerdulate something else
Nothing in mind? Surprise me · today’s page