Recognised as Number
3,503,650
- Positive
- Even
- Composite
- 7 digits
3,503,650 is an even 7-digit integer and a composite number. It has 24 divisors and a digital root of 4.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value3,503,650
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 numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 5^2 × 79 × 887
Distinct prime factors42, 5, 79, 887
Number of divisors24
Sum of divisors σ(n)6,606,720
Aliquot sum3,103,070sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,382,160integers below n that share no factor with it
Carmichael function λ(n)345,540the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,382,160
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 5, 10, 25, 50, 79, 158, 395, 790, 887, 1,774, 1,975, 3,950, 4,435, 8,870, 22,175, 44,350, 70,073, 140,146, 350,365, 700,730, 1,751,825, 3,503,65024 in total
Arithmetic
Previous number3,503,649
Next number3,503,651
Double7,007,300
Half1,751,825
Square12,275,563,322,500
Cube43,009,277,434,877,125,000
Square root1,871.803942725≈irrational, shown to 9 decimal places
Cube root151.882209066≈
Negation-3,503,650
Reciprocal2.85416637 × 10^-7≈
Representations
Decimal3,503,650
Binary110101011101100010001022 bits
Octal15273042
Hexadecimal357622
Base 36233FM
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, five hundred and three thousand, six hundred and fifty
Ordinalthree million, five hundred and three thousand, six hundred and fiftieth
Scientific notation3.50365 × 10^6
Engineering notation3.50365 × 10^6
In other bases
Ternary20121000002211base 3; the most digit-efficient integer base after e: 14 digits
Quinary1344104100base 5; one hand: 10 digits
Septenary41531503base 7: 8 digits
Nonary6530084base 9; each digit is two ternary digits: 7 digits
Duodecimal120b6aabase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal11hj2abase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:13:14:10base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1TT1000010T11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010101000101001100110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101010111011000100010
Bit length22 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits11within that length
Bit parityodd11 set bits, so odd; not the same as the number itself being even
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes335 76 22
Gray code1011111100110100110011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101010111011000100010
64-bit0000000000000000000000000000000000000000001101010111011000100010
One's complement11111111110010101000100111011101at 32 bits, every bit flipped
Bits reversed01000100011011101010110000000000at 32 bits
Rotated left by 100000000011010101110110001000100at 32 bits, wrapping
Shifted left by 111010101110110001000100= 7,007,300, no wrap
Shifted right by 1110101011101100010001= 1,751,825, discarding the low bit
These bits as a double1.7310331 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,503,650 to the power 212,275,563,322,500
3,503,650 to the power 343,009,277,434,877,125,000
3,503,650 to the power 4150,689,454,884,707,239,006,250,000
3,503,650 to the power 5527,963,108,606,804,517,944,247,812,500,000
First ten multiples3,503,650, 7,007,300, 10,510,950, 14,014,600, 17,518,250, 21,021,900, 24,525,550, 28,029,200, 31,532,850, 35,036,500
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 4No, remainder 2
Divisible by 5Yes
Divisible by 6No, remainder 4
Divisible by 7No, remainder 3
Divisible by 8No, remainder 2
Divisible by 9No, remainder 4
Divisible by 10Yes
Divisible by 11No, remainder 7
Divisible by 12No, remainder 10
Divisible by 100No, remainder 50
Collatz (3n + 1) trajectory
Steps to reach 1221the total stopping time
Highest value reached5,255,4761× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,503,650 → 1,751,825 → 5,255,476 → 2,627,738 → 1,313,869 → 3,941,608 → 1,970,804 → 985,402 → 492,701 → 1,478,104 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage350,365,000%
3,503,650% as a decimal35,036.5
3,503,650% of 1003,503,650
3,503,650% of 1,00035,036,500
As a fraction of 1003,503,650/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,503,650
Nerdulate something else
Nothing in mind? Surprise me · today’s page