Recognised as Number

3,675,436

Positive
Even
Composite
7 digits

3,675,436 is an even 7-digit integer and a composite number. It has 24 divisors and a digital root of 7.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value3,675,436

Digit count7

Digit sum34

Digit product45,360

Multiplicative persistence2times the digit product can be taken before one digit is left

Digital root7repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^2 × 19 × 137 × 353

Distinct prime factors42, 19, 137, 353

Number of divisors24

Sum of divisors σ(n)6,839,280

Aliquot sum3,163,844sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)1,723,392integers below n that share no factor with it

Carmichael function λ(n)53,856the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,723,392

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 2, 4, 19, 38, 76, 137, 274, 353, 548, 706, 1,412, 2,603, 5,206, 6,707, 10,412, 13,414, 26,828, 48,361, 96,722, 193,444, 918,859, 1,837,718, 3,675,43624 in total

Arithmetic

Previous number3,675,435

Next number3,675,437

Double7,350,872

Half1,837,718

Square13,508,829,790,096

Cube49,650,839,328,391,281,856

Square root1,917.142665531≈irrational, shown to 9 decimal places

Cube root154.325000937≈

Negation-3,675,436

Reciprocal2.72076565 × 10^-7≈

Representations

Decimal3,675,436

Binary111000000101010010110022 bits

Octal16012454

Hexadecimal38152C

Base 3626RZG

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordsthree million, six hundred and seventy-five thousand, four hundred and thirty-six

Ordinalthree million, six hundred and seventy-five thousand, four hundred and thirty-sixth

Scientific notation3.675436 × 10^6

Engineering notation3.675436 × 10^6

In other bases

Ternary20220201202021base 3; the most digit-efficient integer base after e: 14 digits

Quinary1420103221base 5; one hand: 10 digits

Septenary43145362base 7: 8 digits

Nonary6821667base 9; each digit is two ternary digits: 7 digits

Duodecimal1292ba4base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits

Vigesimal12j8bgbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits

Sexagesimal17:0:57:16base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

Balanced ternary1T10T1T1TT1T1T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary10010000001010101111100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000001110000001010100101100

Bit length22 bitsto write the magnitude

Set bits9the population count, or Hamming weight

Zero bits13within that length

Bit parityodd9 set bits, so odd; 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

Bytes338 15 2c

Gray code1001000001111110111010n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000001110000001010100101100

64-bit0000000000000000000000000000000000000000001110000001010100101100

One's complement11111111110001111110101011010011at 32 bits, every bit flipped

Bits reversed00110100101010000001110000000000at 32 bits

Rotated left by 100000000011100000010101001011000at 32 bits, wrapping

Shifted left by 111100000010101001011000= 7,350,872, no wrap

Shifted right by 1111000000101010010110= 1,837,718, discarding the low bit

These bits as a double1.81590666 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime3,675,439+3

Previous prime3,675,403−33

Distance to nearest prime3

Nearest square below3,674,889

Nearest square above3,678,724

Powers & multiples

3,675,436 to the power 213,508,829,790,096

3,675,436 to the power 349,650,839,328,391,281,856

3,675,436 to the power 4182,488,482,297,785,139,419,689,216

3,675,436 to the power 5670,724,737,422,642,221,688,144,853,298,176

First ten multiples3,675,436, 7,350,872, 11,026,308, 14,701,744, 18,377,180, 22,052,616, 25,728,052, 29,403,488, 33,078,924, 36,754,360

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 1

Divisible by 6No, remainder 4

Divisible by 7No, remainder 2

Divisible by 8No, remainder 4

Divisible by 9No, remainder 7

Divisible by 10No, remainder 6

Divisible by 11No, remainder 6

Divisible by 12No, remainder 4

Divisible by 100No, remainder 36

Collatz (3n + 1) trajectory

Steps to reach 1110the total stopping time

Highest value reached4,134,8681× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps3,675,436 → 1,837,718 → 918,859 → 2,756,578 → 1,378,289 → 4,134,868 → 2,067,434 → 1,033,717 → 3,101,152 → 1,550,576 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage367,543,600%

3,675,436% as a decimal36,754.36

3,675,436% of 1003,675,436

3,675,436% of 1,00036,754,360

As a fraction of 1003,675,436/100

Read another way

As seconds42 days, 12 hours and 57 minutes

As bytes3.505 MiB

As a 24-bit colour#38152C

Keep nerding

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