Nerdulator> put something in

Recognised as Number

3,501,534

  • Positive
  • Even
  • Composite
  • 7 digits

3,501,534 is an even 7-digit integer and a composite number. It has 16 divisors and a digital root of 3.

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value3,501,534
Digit count7
Digit sum21
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 3 × 457 × 1,277
Distinct prime factors42, 3, 457, 1,277
Number of divisors16
Sum of divisors σ(n)7,023,888
Aliquot sum3,522,354sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)1,163,712integers below n that share no factor with it
Carmichael function λ(n)145,464the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,163,712
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 3, 6, 457, 914, 1,277, 1,371, 2,554, 2,742, 3,831, 7,662, 583,589, 1,167,178, 1,750,767, 3,501,53416 in total

Arithmetic

Previous number3,501,533
Next number3,501,535
Double7,003,068
Cube42,931,399,211,747,741,304
Square root1,871.23862722≈irrational, shown to 9 decimal places
Cube root151.851626913≈
Negation-3,501,534
Reciprocal2.85589116 × 10^-7≈

Representations

Decimal3,501,534
Binary110101011011011101111022 bits
Octal15266736
Hexadecimal356DDE
Base 36231SU
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, five hundred and one thousand, five hundred and thirty-four
Ordinalthree million, five hundred and one thousand, five hundred and thirty-fourth
Scientific notation3.501534 × 10^6
Engineering notation3.501534 × 10^6

In other bases

Ternary20120220012110base 3; the most digit-efficient integer base after e: 14 digits
Quinary1344022114base 5; one hand: 10 digits
Septenary41522361base 7: 8 digits
Nonary6526173base 9; each digit is two ternary digits: 7 digits
Duodecimal120a426base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal11hdgebase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:12:38:54base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1TT10T01TT110digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010101011001000100010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000001101010110110111011110
Bit length22 bitsto write the magnitude
Set bits15the population count, or Hamming weight
Zero bits7within that length
Bit parityodd15 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 6d de
Gray code1011111101101100110001n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000001101010110110111011110
64-bit0000000000000000000000000000000000000000001101010110110111011110
One's complement11111111110010101001001000100001at 32 bits, every bit flipped
Bits reversed01111011101101101010110000000000at 32 bits
Rotated left by 100000000011010101101101110111100at 32 bits, wrapping
Shifted left by 111010101101101110111100= 7,003,068, no wrap
Shifted right by 1110101011011011101111= 1,750,767, discarding the low bit
These bits as a double1.72998766 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime3,501,587+53
Previous prime3,501,503−31
Distance to nearest prime31
Nearest square below3,500,641
Nearest square above3,504,384

Powers & multiples

3,501,534 to the power 212,260,740,353,156
3,501,534 to the power 342,931,399,211,747,741,304
3,501,534 to the power 4150,325,754,007,507,915,599,160,336
3,501,534 to the power 5526,370,738,732,925,221,739,590,287,955,424
First ten multiples3,501,534, 7,003,068, 10,504,602, 14,006,136, 17,507,670, 21,009,204, 24,510,738, 28,012,272, 31,513,806, 35,015,340
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)

Divisibility tests

Divisible by 2Yes
Divisible by 3Yes
Divisible by 4No, remainder 2
Divisible by 5No, remainder 4
Divisible by 6Yes
Divisible by 7No, remainder 1
Divisible by 8No, remainder 6
Divisible by 9No, remainder 3
Divisible by 10No, remainder 4
Divisible by 11No, remainder 3
Divisible by 12No, remainder 6
Divisible by 100No, remainder 34

Collatz (3n + 1) trajectory

Steps to reach 171the total stopping time
Highest value reached44,870,27212× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,501,534 → 1,750,767 → 5,252,302 → 2,626,151 → 7,878,454 → 3,939,227 → 11,817,682 → 5,908,841 → 17,726,524 → 8,863,262 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage350,153,400%
3,501,534% as a decimal35,015.34
3,501,534% of 1003,501,534
3,501,534% of 1,00035,015,340
As a fraction of 1003,501,534/100

Read another way

As bytes3.339 MiB
As a 24-bit colour#356DDE

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “3501534” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.