Recognised as Number
3,225,112
- Positive
- Even
- Composite
- 7 digits
3,225,112 is an even 7-digit integer and a composite number. It has 32 divisors and a digital root of 7.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value3,225,112
Digit count7
Digit sum16
Digit product120
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^3 × 11 × 67 × 547
Distinct prime factors42, 11, 67, 547
Number of divisors32
Sum of divisors σ(n)6,707,520
Aliquot sum3,482,408sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)1,441,440integers below n that share no factor with it
Carmichael function λ(n)30,030the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,441,440
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 11, 22, 44, 67, 88, 134, 268, 536, 547, 737, 1,094, 1,474, 2,188, 2,948, 4,376, 5,896, 6,017, 12,034, 24,068, 36,649, 48,136, 73,298, 146,596, 293,192, 403,139, 806,278, 1,612,556, 3,225,11232 in total
Arithmetic
Previous number3,225,111
Next number3,225,113
Double6,450,224
Half1,612,556
Square10,401,347,412,544
Cube33,545,510,356,364,604,928
Square root1,795.859682715≈irrational, shown to 9 decimal places
Cube root147.745728483≈
Negation-3,225,112
Reciprocal3.10066751 × 10^-7≈
Representations
Decimal3,225,112
Binary110001001101100001100022 bits
Octal14233030
Hexadecimal313618
Base 361X4IG
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, two hundred and twenty-five thousand, one hundred and twelve
Ordinalthree million, two hundred and twenty-five thousand, one hundred and twelfth
Scientific notation3.225112 × 10^6
Engineering notation3.225112 × 10^6
In other bases
Ternary20001212000121base 3; the most digit-efficient integer base after e: 14 digits
Quinary1311200422base 5; one hand: 10 digits
Septenary36261442base 7: 8 digits
Nonary6055017base 9; each digit is two ternary digits: 7 digits
Duodecimal10b6474base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1032fcbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal14:55:51:52base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T001T0TT001TT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11100010100101001101000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100010011011000011000
Bit length22 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits13within that length
Bit parityodd9 set bits, so odd; 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
Bytes331 36 18
Gray code1010011010110100010100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100010011011000011000
64-bit0000000000000000000000000000000000000000001100010011011000011000
One's complement11111111110011101100100111100111at 32 bits, every bit flipped
Bits reversed00011000011011001000110000000000at 32 bits
Rotated left by 100000000011000100110110000110000at 32 bits, wrapping
Shifted left by 111000100110110000110000= 6,450,224, no wrap
Shifted right by 1110001001101100001100= 1,612,556, discarding the low bit
These bits as a double1.59341704 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,225,112 to the power 210,401,347,412,544
3,225,112 to the power 333,545,510,356,364,604,928
3,225,112 to the power 4108,188,027,996,435,763,728,551,936
3,225,112 to the power 5348,918,507,347,640,938,830,117,591,416,832
First ten multiples3,225,112, 6,450,224, 9,675,336, 12,900,448, 16,125,560, 19,350,672, 22,575,784, 25,800,896, 29,026,008, 32,251,120
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 2
Divisible by 8Yes
Divisible by 9No, remainder 7
Divisible by 10No, remainder 2
Divisible by 11Yes
Divisible by 12No, remainder 4
Divisible by 100No, remainder 12
Collatz (3n + 1) trajectory
Steps to reach 1257the total stopping time
Highest value reached2,482,111,348769× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,225,112 → 1,612,556 → 806,278 → 403,139 → 1,209,418 → 604,709 → 1,814,128 → 907,064 → 453,532 → 226,766 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage322,511,200%
3,225,112% as a decimal32,251.12
3,225,112% of 1003,225,112
3,225,112% of 1,00032,251,120
As a fraction of 1003,225,112/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,225,112
Nerdulate something else
Nothing in mind? Surprise me · today’s page