Recognised as Number
3,355,490
- Positive
- Even
- Composite
- 7 digits
3,355,490 is an even 7-digit integer and a composite number. It has 16 divisors and a digital root of 2.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value3,355,490
Digit count7
Digit sum29
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 × 5 × 347 × 967
Distinct prime factors42, 5, 347, 967
Number of divisors16
Sum of divisors σ(n)6,063,552
Aliquot sum2,708,062sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,336,944integers below n that share no factor with it
Carmichael function λ(n)334,236the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,336,944
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 5, 10, 347, 694, 967, 1,735, 1,934, 3,470, 4,835, 9,670, 335,549, 671,098, 1,677,745, 3,355,49016 in total
Arithmetic
Previous number3,355,489
Next number3,355,491
Double6,710,980
Half1,677,745
Square11,259,313,140,100
Cube37,780,512,648,474,149,000
Square root1,831.799661535≈irrational, shown to 9 decimal places
Cube root149.710404218≈
Negation-3,355,490
Reciprocal2.98019067 × 10^-7≈
Representations
Decimal3,355,490
Binary110011001100110110001022 bits
Octal14631542
Hexadecimal333362
Base 361ZX42
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, three hundred and fifty-five thousand, four hundred and ninety
Ordinalthree million, three hundred and fifty-five thousand, four hundred and ninetieth
Scientific notation3.35549 × 10^6
Engineering notation3.35549 × 10^6
In other bases
Ternary20022110212102base 3; the most digit-efficient integer base after e: 14 digits
Quinary1324333430base 5; one hand: 10 digits
Septenary40343525base 7: 8 digits
Nonary6273772base 9; each digit is two ternary digits: 7 digits
Duodecimal1159a02base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal10j8eabase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:32:4:50base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T010T1110TT11Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101110111010010100110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100110011001101100010
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 even
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes333 33 62
Gray code1010101010101011010011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100110011001101100010
64-bit0000000000000000000000000000000000000000001100110011001101100010
One's complement11111111110011001100110010011101at 32 bits, every bit flipped
Bits reversed01000110110011001100110000000000at 32 bits
Rotated left by 100000000011001100110011011000100at 32 bits, wrapping
Shifted left by 111001100110011011000100= 6,710,980, no wrap
Shifted right by 1110011001100110110001= 1,677,745, discarding the low bit
These bits as a double1.65783233 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,355,490 to the power 211,259,313,140,100
3,355,490 to the power 337,780,512,648,474,149,000
3,355,490 to the power 4126,772,132,386,828,522,228,010,000
3,355,490 to the power 5425,382,622,502,679,238,050,865,274,900,000
First ten multiples3,355,490, 6,710,980, 10,066,470, 13,421,960, 16,777,450, 20,132,940, 23,488,430, 26,843,920, 30,199,410, 33,554,900
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 5Yes
Divisible by 6No, remainder 2
Divisible by 7No, remainder 5
Divisible by 8No, remainder 2
Divisible by 9No, remainder 2
Divisible by 10Yes
Divisible by 11No, remainder 6
Divisible by 12No, remainder 2
Divisible by 100No, remainder 90
Collatz (3n + 1) trajectory
Steps to reach 1146the total stopping time
Highest value reached5,033,2361× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,355,490 → 1,677,745 → 5,033,236 → 2,516,618 → 1,258,309 → 3,774,928 → 1,887,464 → 943,732 → 471,866 → 235,933 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage335,549,000%
3,355,490% as a decimal33,554.9
3,355,490% of 1003,355,490
3,355,490% of 1,00033,554,900
As a fraction of 1003,355,490/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,490
Nerdulate something else
Nothing in mind? Surprise me · today’s page