Recognised as Number
3,556,478
- Positive
- Even
- Composite
- 7 digits
3,556,478 is an even 7-digit integer and a composite number. It has 4 divisors and a digital root of 2.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value3,556,478
Digit count7
Digit sum38
Digit product100,800
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 1,778,239
Distinct prime factors22, 1,778,239
Number of divisors4
Sum of divisors σ(n)5,334,720
Aliquot sum1,778,242sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,778,238integers below n that share no factor with it
Carmichael function λ(n)1,778,238the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 1,778,239, 3,556,4784 in total
Arithmetic
Previous number3,556,477
Next number3,556,479
Double7,112,956
Half1,778,239
Square12,648,535,764,484
Cube44,984,239,178,600,527,352
Square root1,885.862667322≈irrational, shown to 9 decimal places
Cube root152.641763724≈
Negation-3,556,478
Reciprocal2.81177052 × 10^-7≈
Representations
Decimal3,556,478
Binary110110010001000111111022 bits
Octal15442176
Hexadecimal36447E
Base 3624872
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, five hundred and fifty-six thousand, four hundred and seventy-eight
Ordinalthree million, five hundred and fifty-six thousand, four hundred and seventy-eighth
Scientific notation3.556478 × 10^6
Engineering notation3.556478 × 10^6
In other bases
Ternary20200200120102base 3; the most digit-efficient integer base after e: 14 digits
Quinary1402301403base 5; one hand: 10 digits
Septenary42141512base 7: 8 digits
Nonary6620512base 9; each digit is two ternary digits: 7 digits
Duodecimal1236192base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal124b3ibase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:27:54:38base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1T01T01TT011Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010100100010110000010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101100100010001111110
Bit length22 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits10within that length
Bit parityeven12 set bits, so even; 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
Bytes336 44 7e
Gray code1011010110011001000001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101100100010001111110
64-bit0000000000000000000000000000000000000000001101100100010001111110
One's complement11111111110010011011101110000001at 32 bits, every bit flipped
Bits reversed01111110001000100110110000000000at 32 bits
Rotated left by 100000000011011001000100011111100at 32 bits, wrapping
Shifted left by 111011001000100011111100= 7,112,956, no wrap
Shifted right by 1110110010001000111111= 1,778,239, discarding the low bit
These bits as a double1.7571336 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,556,478 to the power 212,648,535,764,484
3,556,478 to the power 344,984,239,178,600,527,352
3,556,478 to the power 4159,985,456,985,430,846,315,786,256
3,556,478 to the power 5568,984,758,088,631,125,443,474,872,166,368
First ten multiples3,556,478, 7,112,956, 10,669,434, 14,225,912, 17,782,390, 21,338,868, 24,895,346, 28,451,824, 32,008,302, 35,564,780
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 4No, remainder 2
Divisible by 5No, remainder 3
Divisible by 6No, remainder 2
Divisible by 7No, remainder 2
Divisible by 8No, remainder 6
Divisible by 9No, remainder 2
Divisible by 10No, remainder 8
Divisible by 11No, remainder 2
Divisible by 12No, remainder 2
Divisible by 100No, remainder 78
Collatz (3n + 1) trajectory
Steps to reach 197the total stopping time
Highest value reached40,510,52811× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,556,478 → 1,778,239 → 5,334,718 → 2,667,359 → 8,002,078 → 4,001,039 → 12,003,118 → 6,001,559 → 18,004,678 → 9,002,339 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage355,647,800%
3,556,478% as a decimal35,564.78
3,556,478% of 1003,556,478
3,556,478% of 1,00035,564,780
As a fraction of 1003,556,478/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,478
Nerdulate something else
Nothing in mind? Surprise me · today’s page