Recognised as Number
3,350,155
- Positive
- Odd
- Composite
- 7 digits
3,350,155 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,350,155
Digit count7
Digit sum22
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation5 × 670,031
Distinct prime factors25, 670,031
Number of divisors4
Sum of divisors σ(n)4,020,192
Aliquot sum670,037sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,680,120integers below n that share no factor with it
Carmichael function λ(n)1,340,060the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,680,120
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 5, 670,031, 3,350,1554 in total
Arithmetic
Previous number3,350,154
Next number3,350,156
Double6,700,310
Half1,675,077.5
Square11,223,538,524,025
Cube37,600,593,703,954,973,875
Square root1,830.342864056≈irrational, shown to 9 decimal places
Cube root149.631019024≈
Negation-3,350,155
Reciprocal2.98493652 × 10^-7≈
Representations
Decimal3,350,155
Binary110011000111101000101122 bits
Octal14617213
Hexadecimal331E8B
Base 361ZSZV
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, three hundred and fifty thousand, one hundred and fifty-five
Ordinalthree million, three hundred and fifty thousand, one hundred and fifty-fifth
Scientific notation3.350155 × 10^6
Engineering notation3.350155 × 10^6
In other bases
Ternary20022012112211base 3; the most digit-efficient integer base after e: 14 digits
Quinary1324201110base 5; one hand: 10 digits
Septenary40322134base 7: 8 digits
Nonary6265484base 9; each digit is two ternary digits: 7 digits
Duodecimal11568b7base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal10if7fbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:30:35:55base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T010T1T0TT0T11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101110110001110011111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100110001111010001011
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 1e 8b
Gray code1010101001000111001110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100110001111010001011
64-bit0000000000000000000000000000000000000000001100110001111010001011
One's complement11111111110011001110000101110100at 32 bits, every bit flipped
Bits reversed11010001011110001100110000000000at 32 bits
Rotated left by 100000000011001100011110100010110at 32 bits, wrapping
Shifted left by 111001100011110100010110= 6,700,310, no wrap
Shifted right by 1110011000111101000101= 1,675,077, discarding the low bit
These bits as a double1.65519649 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,350,155 to the power 211,223,538,524,025
3,350,155 to the power 337,600,593,703,954,973,875
3,350,155 to the power 4125,967,817,000,273,275,502,200,625
3,350,155 to the power 5422,011,711,962,550,515,290,074,934,846,875
First ten multiples3,350,155, 6,700,310, 10,050,465, 13,400,620, 16,750,775, 20,100,930, 23,451,085, 26,801,240, 30,151,395, 33,501,550
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 3
Divisible by 5Yes
Divisible by 6No, remainder 1
Divisible by 7No, remainder 4
Divisible by 8No, remainder 3
Divisible by 9No, remainder 4
Divisible by 10No, remainder 5
Divisible by 11No, remainder 6
Divisible by 12No, remainder 7
Divisible by 100No, remainder 55
Collatz (3n + 1) trajectory
Steps to reach 1177the total stopping time
Highest value reached15,075,7004× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,350,155 → 10,050,466 → 5,025,233 → 15,075,700 → 7,537,850 → 3,768,925 → 11,306,776 → 5,653,388 → 2,826,694 → 1,413,347 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage335,015,500%
3,350,155% as a decimal33,501.55
3,350,155% of 1003,350,155
3,350,155% of 1,00033,501,550
As a fraction of 1003,350,155/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,350,155
Nerdulate something else
Nothing in mind? Surprise me · today’s page