Recognised as Number
3,491,228
- Positive
- Even
- Composite
- 7 digits
3,491,228 is an even 7-digit integer and a composite number. It has 12 divisors and a digital root of 2.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value3,491,228
Digit count7
Digit sum29
Digit product3,456
Multiplicative persistence3times 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^2 × 13 × 67,139
Distinct prime factors32, 13, 67,139
Number of divisors12
Sum of divisors σ(n)6,579,720
Aliquot sum3,088,492sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,611,312integers below n that share no factor with it
Carmichael function λ(n)402,828the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,611,312
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 13, 26, 52, 67,139, 134,278, 268,556, 872,807, 1,745,614, 3,491,22812 in total
Arithmetic
Previous number3,491,227
Next number3,491,229
Double6,982,456
Half1,745,614
Square12,188,672,947,984
Cube42,553,436,278,844,284,352
Square root1,868.482806985≈irrational, shown to 9 decimal places
Cube root151.702499819≈
Negation-3,491,228
Reciprocal2.86432167 × 10^-7≈
Representations
Decimal3,491,228
Binary110101010001011001110022 bits
Octal15242634
Hexadecimal35459C
Base 3622TUK
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, four hundred and ninety-one thousand, two hundred and twenty-eight
Ordinalthree million, four hundred and ninety-one thousand, two hundred and twenty-eighth
Scientific notation3.491228 × 10^6
Engineering notation3.491228 × 10^6
In other bases
Ternary20120101001202base 3; the most digit-efficient integer base after e: 14 digits
Quinary1343204403base 5; one hand: 10 digits
Septenary41450336base 7: 8 digits
Nonary6511052base 9; each digit is two ternary digits: 7 digits
Duodecimal1204478base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal11g818base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:9:47:8base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1TT010101TT1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101010101101011101100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101010100010110011100
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 22 trailing zeros
Power of twoNo
Bytes335 45 9c
Gray code1011111110011101010010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101010100010110011100
64-bit0000000000000000000000000000000000000000001101010100010110011100
One's complement11111111110010101011101001100011at 32 bits, every bit flipped
Bits reversed00111001101000101010110000000000at 32 bits
Rotated left by 100000000011010101000101100111000at 32 bits, wrapping
Shifted left by 111010101000101100111000= 6,982,456, no wrap
Shifted right by 1110101010001011001110= 1,745,614, discarding the low bit
These bits as a double1.72489582 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,491,228 to the power 212,188,672,947,984
3,491,228 to the power 342,553,436,278,844,284,352
3,491,228 to the power 4148,563,748,232,916,973,169,664,256
3,491,228 to the power 5518,669,917,615,710,258,405,180,601,146,368
First ten multiples3,491,228, 6,982,456, 10,473,684, 13,964,912, 17,456,140, 20,947,368, 24,438,596, 27,929,824, 31,421,052, 34,912,280
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 4Yes
Divisible by 5No, remainder 3
Divisible by 6No, remainder 2
Divisible by 7No, remainder 6
Divisible by 8No, remainder 4
Divisible by 9No, remainder 2
Divisible by 10No, remainder 8
Divisible by 11No, remainder 4
Divisible by 12No, remainder 8
Divisible by 100No, remainder 28
Collatz (3n + 1) trajectory
Steps to reach 1296the total stopping time
Highest value reached24,213,3286× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,491,228 → 1,745,614 → 872,807 → 2,618,422 → 1,309,211 → 3,927,634 → 1,963,817 → 5,891,452 → 2,945,726 → 1,472,863 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage349,122,800%
3,491,228% as a decimal34,912.28
3,491,228% of 1003,491,228
3,491,228% of 1,00034,912,280
As a fraction of 1003,491,228/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,491,228
Nerdulate something else
Nothing in mind? Surprise me · today’s page