Recognised as Number
3,350,152
- Positive
- Even
- Composite
- 7 digits
3,350,152 is an even 7-digit integer and a composite number. It has 16 divisors and a digital root of 1.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value3,350,152
Digit count7
Digit sum19
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^3 × 13 × 32,213
Distinct prime factors32, 13, 32,213
Number of divisors16
Sum of divisors σ(n)6,764,940
Aliquot sum3,414,788sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)1,546,176integers below n that share no factor with it
Carmichael function λ(n)96,636the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,546,176
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 13, 26, 52, 104, 32,213, 64,426, 128,852, 257,704, 418,769, 837,538, 1,675,076, 3,350,15216 in total
Arithmetic
Previous number3,350,151
Next number3,350,153
Double6,700,304
Half1,675,076
Square11,223,518,423,104
Cube37,600,492,692,198,711,808
Square root1,830.342044537≈irrational, shown to 9 decimal places
Cube root149.63097436≈
Negation-3,350,152
Reciprocal2.98493919 × 10^-7≈
Representations
Decimal3,350,152
Binary110011000111101000100022 bits
Octal14617210
Hexadecimal331E88
Base 361ZSZS
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, three hundred and fifty thousand, one hundred and fifty-two
Ordinalthree million, three hundred and fifty thousand, one hundred and fifty-second
Scientific notation3.350152 × 10^6
Engineering notation3.350152 × 10^6
In other bases
Ternary20022012112201base 3; the most digit-efficient integer base after e: 14 digits
Quinary1324201102base 5; one hand: 10 digits
Septenary40322131base 7: 8 digits
Nonary6265481base 9; each digit is two ternary digits: 7 digits
Duodecimal11568b4base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal10if7cbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:30:35:52base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T010T1T0TT0T01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101110110001110011000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100110001111010001000
Bit length22 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits12within that length
Bit parityeven10 set bits, so even; not the same as the number itself being even
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 33 trailing zeros
Power of twoNo
Bytes333 1e 88
Gray code1010101001000111001100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100110001111010001000
64-bit0000000000000000000000000000000000000000001100110001111010001000
One's complement11111111110011001110000101110111at 32 bits, every bit flipped
Bits reversed00010001011110001100110000000000at 32 bits
Rotated left by 100000000011001100011110100010000at 32 bits, wrapping
Shifted left by 111001100011110100010000= 6,700,304, no wrap
Shifted right by 1110011000111101000100= 1,675,076, discarding the low bit
These bits as a double1.65519501 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,350,152 to the power 211,223,518,423,104
3,350,152 to the power 337,600,492,692,198,711,808
3,350,152 to the power 4125,967,365,793,754,898,760,994,816
3,350,152 to the power 5422,009,822,448,679,561,593,944,304,812,032
First ten multiples3,350,152, 6,700,304, 10,050,456, 13,400,608, 16,750,760, 20,100,912, 23,451,064, 26,801,216, 30,151,368, 33,501,520
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 5No, remainder 2
Divisible by 6No, remainder 4
Divisible by 7No, remainder 1
Divisible by 8Yes
Divisible by 9No, remainder 1
Divisible by 10No, remainder 2
Divisible by 11No, remainder 3
Divisible by 12No, remainder 4
Divisible by 100No, remainder 52
Collatz (3n + 1) trajectory
Steps to reach 1177the total stopping time
Highest value reached3,350,152
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,350,152 → 1,675,076 → 837,538 → 418,769 → 1,256,308 → 628,154 → 314,077 → 942,232 → 471,116 → 235,558 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage335,015,200%
3,350,152% as a decimal33,501.52
3,350,152% of 1003,350,152
3,350,152% of 1,00033,501,520
As a fraction of 1003,350,152/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,152
Nerdulate something else
Nothing in mind? Surprise me · today’s page