Nerdulator> put something in

Recognised as Number

3,566,096

  • Positive
  • Even
  • Composite
  • 7 digits

3,566,096 is an even 7-digit integer and a composite number. It has 20 divisors and a digital root of 8.

Number properties

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

Factors & divisors

Prime factorisation2^4 × 107 × 2,083
Distinct prime factors32, 107, 2,083
Number of divisors20
Sum of divisors σ(n)6,977,232
Aliquot sum3,411,136sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,765,536integers below n that share no factor with it
Carmichael function λ(n)220,692the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,765,536
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 16, 107, 214, 428, 856, 1,712, 2,083, 4,166, 8,332, 16,664, 33,328, 222,881, 445,762, 891,524, 1,783,048, 3,566,09620 in total

Arithmetic

Previous number3,566,095
Next number3,566,097
Double7,132,192
Cube45,350,187,905,121,652,736
Square root1,888.41097222≈irrational, shown to 9 decimal places
Cube root152.779239342≈
Negation-3,566,096
Reciprocal2.80418699 × 10^-7≈

Representations

Decimal3,566,096
Binary110110011010100001000022 bits
Octal15465020
Hexadecimal366A10
Base 3624FM8
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, five hundred and sixty-six thousand and ninety-six
Ordinalthree million, five hundred and sixty-six thousand and ninety-sixth
Scientific notation3.566096 × 10^6
Engineering notation3.566096 × 10^6

In other bases

Ternary20201011202122base 3; the most digit-efficient integer base after e: 14 digits
Quinary1403103341base 5; one hand: 10 digits
Septenary42211532base 7: 8 digits
Nonary6634678base 9; each digit is two ternary digits: 7 digits
Duodecimal123b868base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal125f4gbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:30:34:56base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1T011TTT10T0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010111011111000010000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000001101100110101000010000
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 44 trailing zeros
Power of twoNo
Bytes336 6a 10
Gray code1011010101111100011000n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000001101100110101000010000
64-bit0000000000000000000000000000000000000000001101100110101000010000
One's complement11111111110010011001010111101111at 32 bits, every bit flipped
Bits reversed00001000010101100110110000000000at 32 bits
Rotated left by 100000000011011001101010000100000at 32 bits, wrapping
Shifted left by 111011001101010000100000= 7,132,192, no wrap
Shifted right by 1110110011010100001000= 1,783,048, discarding the low bit
These bits as a double1.76188552 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime3,566,099+3
Previous prime3,566,063−33
Distance to nearest prime3
Nearest square below3,564,544
Nearest square above3,568,321

Powers & multiples

3,566,096 to the power 212,717,040,681,216
3,566,096 to the power 345,350,187,905,121,652,736
3,566,096 to the power 4161,723,123,687,702,705,335,238,656
3,566,096 to the power 5576,720,184,490,221,866,685,173,230,206,976
First ten multiples3,566,096, 7,132,192, 10,698,288, 14,264,384, 17,830,480, 21,396,576, 24,962,672, 28,528,768, 32,094,864, 35,660,960
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 1172the total stopping time
Highest value reached3,566,096
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,566,096 → 1,783,048 → 891,524 → 445,762 → 222,881 → 668,644 → 334,322 → 167,161 → 501,484 → 250,742 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage356,609,600%
3,566,096% as a decimal35,660.96
3,566,096% of 1003,566,096
3,566,096% of 1,00035,660,960
As a fraction of 1003,566,096/100

Read another way

As bytes3.401 MiB
As a 24-bit colour#366A10

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 “3566096” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.