Recognised as Number
3,355,569
- Positive
- Odd
- Composite
- 7 digits
3,355,569 is an odd 7-digit integer and a composite number. It has 24 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,355,569
Digit count7
Digit sum36
Digit product60,750
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3^2 × 7^3 × 1,087
Distinct prime factors33, 7, 1,087
Number of divisors24
Sum of divisors σ(n)5,657,600
Aliquot sum2,302,031sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,915,704integers below n that share no factor with it
Carmichael function λ(n)53,214the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,915,704
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 7, 9, 21, 49, 63, 147, 343, 441, 1,029, 1,087, 3,087, 3,261, 7,609, 9,783, 22,827, 53,263, 68,481, 159,789, 372,841, 479,367, 1,118,523, 3,355,56924 in total
Arithmetic
Previous number3,355,568
Next number3,355,570
Double6,711,138
Half1,677,784.5
Square11,259,843,313,761
Cube37,783,181,168,513,685,009
Square root1,831.821224902≈irrational, shown to 9 decimal places
Cube root149.711579111≈
Negation-3,355,569
Reciprocal2.98012051 × 10^-7≈
Representations
Decimal3,355,569
Binary110011001100111011000122 bits
Octal14631661
Hexadecimal3333B1
Base 361ZX69
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, three hundred and fifty-five thousand, five hundred and sixty-nine
Ordinalthree million, three hundred and fifty-five thousand, five hundred and sixty-ninth
Scientific notation3.355569 × 10^6
Engineering notation3.355569 × 10^6
In other bases
Ternary20022110222100base 3; the most digit-efficient integer base after e: 14 digits
Quinary1324334234base 5; one hand: 10 digits
Septenary40344000base 7: 8 digits
Nonary6273870base 9; each digit is two ternary digits: 7 digits
Duodecimal1159a69base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal10j8i9base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:32:6:9base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T010T11100T100digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101110111010011110001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100110011001110110001
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 odd
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes333 33 b1
Gray code1010101010101001101001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100110011001110110001
64-bit0000000000000000000000000000000000000000001100110011001110110001
One's complement11111111110011001100110001001110at 32 bits, every bit flipped
Bits reversed10001101110011001100110000000000at 32 bits
Rotated left by 100000000011001100110011101100010at 32 bits, wrapping
Shifted left by 111001100110011101100010= 6,711,138, no wrap
Shifted right by 1110011001100111011000= 1,677,784, discarding the low bit
These bits as a double1.65787137 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,355,569 to the power 211,259,843,313,761
3,355,569 to the power 337,783,181,168,513,685,009
3,355,569 to the power 4126,784,071,450,448,297,491,965,121
3,355,569 to the power 5425,432,699,852,909,343,166,815,909,108,849
First ten multiples3,355,569, 6,711,138, 10,066,707, 13,422,276, 16,777,845, 20,133,414, 23,488,983, 26,844,552, 30,200,121, 33,555,690
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 5No, remainder 4
Divisible by 6No, remainder 3
Divisible by 7Yes
Divisible by 8No, remainder 1
Divisible by 9Yes
Divisible by 10No, remainder 9
Divisible by 11No, remainder 8
Divisible by 12No, remainder 9
Divisible by 100No, remainder 69
Collatz (3n + 1) trajectory
Steps to reach 1115the total stopping time
Highest value reached10,066,7083× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,355,569 → 10,066,708 → 5,033,354 → 2,516,677 → 7,550,032 → 3,775,016 → 1,887,508 → 943,754 → 471,877 → 1,415,632 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage335,556,900%
3,355,569% as a decimal33,555.69
3,355,569% of 1003,355,569
3,355,569% of 1,00033,555,690
As a fraction of 1003,355,569/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,355,569
Nerdulate something else
Nothing in mind? Surprise me · today’s page