Recognised as Number
3,556,965
- Positive
- Odd
- Composite
- 7 digits
3,556,965 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,556,965
Digit count7
Digit sum39
Digit product121,500
Multiplicative persistence2times 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 factorisation3 × 5 × 83 × 2,857
Distinct prime factors43, 5, 83, 2,857
Number of divisors16
Sum of divisors σ(n)5,761,728
Aliquot sum2,204,763sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,873,536integers below n that share no factor with it
Carmichael function λ(n)117,096the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,873,536
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 5, 15, 83, 249, 415, 1,245, 2,857, 8,571, 14,285, 42,855, 237,131, 711,393, 1,185,655, 3,556,96516 in total
Arithmetic
Previous number3,556,964
Next number3,556,966
Double7,113,930
Half1,778,482.5
Square12,652,000,011,225
Cube45,002,721,219,926,932,125
Square root1,885.99178153≈irrational, shown to 9 decimal places
Cube root152.648730649≈
Negation-3,556,965
Reciprocal2.81138555 × 10^-7≈
Representations
Decimal3,556,965
Binary110110010001100110010122 bits
Octal15443145
Hexadecimal364665
Base 36248KL
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, five hundred and fifty-six thousand, nine hundred and sixty-five
Ordinalthree million, five hundred and fifty-six thousand, nine hundred and sixty-fifth
Scientific notation3.556965 × 10^6
Engineering notation3.556965 × 10^6
In other bases
Ternary20200201020110base 3; the most digit-efficient integer base after e: 14 digits
Quinary1402310330base 5; one hand: 10 digits
Septenary42143106base 7: 8 digits
Nonary6621213base 9; each digit is two ternary digits: 7 digits
Duodecimal1236519base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal124c85base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:28:2:45base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1T01T011T0110digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010100101101110100101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101100100011001100101
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 odd
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes336 46 65
Gray code1011010110010101010111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101100100011001100101
64-bit0000000000000000000000000000000000000000001101100100011001100101
One's complement11111111110010011011100110011010at 32 bits, every bit flipped
Bits reversed10100110011000100110110000000000at 32 bits
Rotated left by 100000000011011001000110011001010at 32 bits, wrapping
Shifted left by 111011001000110011001010= 7,113,930, no wrap
Shifted right by 1110110010001100110010= 1,778,482, discarding the low bit
These bits as a double1.75737421 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,556,965 to the power 212,652,000,011,225
3,556,965 to the power 345,002,721,219,926,932,125
3,556,965 to the power 4160,073,104,284,037,400,126,000,625
3,556,965 to the power 5569,374,429,379,671,090,939,179,813,103,125
First ten multiples3,556,965, 7,113,930, 10,670,895, 14,227,860, 17,784,825, 21,341,790, 24,898,755, 28,455,720, 32,012,685, 35,569,650
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5Yes
Divisible by 6No, remainder 3
Divisible by 7No, remainder 6
Divisible by 8No, remainder 5
Divisible by 9No, remainder 3
Divisible by 10No, remainder 5
Divisible by 11No, remainder 5
Divisible by 12No, remainder 9
Divisible by 100No, remainder 65
Collatz (3n + 1) trajectory
Steps to reach 197the total stopping time
Highest value reached10,670,8963× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,556,965 → 10,670,896 → 5,335,448 → 2,667,724 → 1,333,862 → 666,931 → 2,000,794 → 1,000,397 → 3,001,192 → 1,500,596 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage355,696,500%
3,556,965% as a decimal35,569.65
3,556,965% of 1003,556,965
3,556,965% of 1,00035,569,650
As a fraction of 1003,556,965/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,556,965
Nerdulate something else
Nothing in mind? Surprise me · today’s page