Recognised as Number
3,553,360
- Positive
- Even
- Composite
- 7 digits
3,553,360 is an even 7-digit integer and a composite number. It has 20 divisors and a digital root of 7.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value3,553,360
Digit count7
Digit sum25
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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^4 × 5 × 44,417
Distinct prime factors32, 5, 44,417
Number of divisors20
Sum of divisors σ(n)8,261,748
Aliquot sum4,708,388sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)1,421,312integers below n that share no factor with it
Carmichael function λ(n)44,416the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,421,312
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 5, 8, 10, 16, 20, 40, 80, 44,417, 88,834, 177,668, 222,085, 355,336, 444,170, 710,672, 888,340, 1,776,680, 3,553,36020 in total
Arithmetic
Previous number3,553,359
Next number3,553,361
Double7,106,720
Half1,776,680
Square12,626,367,289,600
Cube44,866,028,472,173,056,000
Square root1,885.035808678≈irrational, shown to 9 decimal places
Cube root152.597143159≈
Negation-3,553,360
Reciprocal2.81423779 × 10^-7≈
Representations
Decimal3,553,360
Binary110110001110000101000022 bits
Octal15434120
Hexadecimal363850
Base 36245SG
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, five hundred and fifty-three thousand, three hundred and sixty
Ordinalthree million, five hundred and fifty-three thousand, three hundred and sixtieth
Scientific notation3.55336 × 10^6
Engineering notation3.55336 × 10^6
In other bases
Ternary20200112021221base 3; the most digit-efficient integer base after e: 14 digits
Quinary1402201420base 5; one hand: 10 digits
Septenary42126436base 7: 8 digits
Nonary6615257base 9; each digit is two ternary digits: 7 digits
Duodecimal1234414base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal124380base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:27:2:40base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1T01TTT10T0T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010100100100001010000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101100011100001010000
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 38 50
Gray code1011010010010001111000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101100011100001010000
64-bit0000000000000000000000000000000000000000001101100011100001010000
One's complement11111111110010011100011110101111at 32 bits, every bit flipped
Bits reversed00001010000111000110110000000000at 32 bits
Rotated left by 100000000011011000111000010100000at 32 bits, wrapping
Shifted left by 111011000111000010100000= 7,106,720, no wrap
Shifted right by 1110110001110000101000= 1,776,680, discarding the low bit
These bits as a double1.7555931 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,553,360 to the power 212,626,367,289,600
3,553,360 to the power 344,866,028,472,173,056,000
3,553,360 to the power 4159,425,150,931,880,850,268,160,000
3,553,360 to the power 5566,494,954,315,308,138,108,869,017,600,000
First ten multiples3,553,360, 7,106,720, 10,660,080, 14,213,440, 17,766,800, 21,320,160, 24,873,520, 28,426,880, 31,980,240, 35,533,600
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 5Yes
Divisible by 6No, remainder 4
Divisible by 7No, remainder 6
Divisible by 8Yes
Divisible by 9No, remainder 7
Divisible by 10Yes
Divisible by 11No, remainder 8
Divisible by 12No, remainder 4
Divisible by 100No, remainder 60
Collatz (3n + 1) trajectory
Steps to reach 1265the total stopping time
Highest value reached3,553,360
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,553,360 → 1,776,680 → 888,340 → 444,170 → 222,085 → 666,256 → 333,128 → 166,564 → 83,282 → 41,641 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage355,336,000%
3,553,360% as a decimal35,533.6
3,553,360% of 1003,553,360
3,553,360% of 1,00035,533,600
As a fraction of 1003,553,360/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,553,360
Nerdulate something else
Nothing in mind? Surprise me · today’s page