Recognised as Number
3,367,225
- Positive
- Odd
- Composite
- Perfect square
- 7 digits
3,367,225 is an odd 7-digit integer and a composite number. It has 9 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,367,225
Digit count7
Digit sum28
Digit product7,560
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Perfect squareYes, 1,835²
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation5^2 × 367^2
Distinct prime factors25, 367
Number of divisors9
Sum of divisors σ(n)4,186,767
Aliquot sum819,542sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,686,440integers below n that share no factor with it
Carmichael function λ(n)1,343,220the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,686,440
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 5, 25, 367, 1,835, 9,175, 134,689, 673,445, 3,367,2259 in total
Arithmetic
Previous number3,367,224
Next number3,367,226
Double6,734,450
Half1,683,612.5
Square11,338,204,200,625
Cube38,178,284,639,449,515,625
Square root1,835exact
Cube root149.884726251≈
Negation-3,367,225
Reciprocal2.96980451 × 10^-7≈
Representations
Decimal3,367,225
Binary110011011000010011100122 bits
Octal14660471
Hexadecimal336139
Base 3620661
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, three hundred and sixty-seven thousand, two hundred and twenty-five
Ordinalthree million, three hundred and sixty-seven thousand, two hundred and twenty-fifth
Scientific notation3.367225 × 10^6
Engineering notation3.367225 × 10^6
In other bases
Ternary20100001222001base 3; the most digit-efficient integer base after e: 14 digits
Quinary1330222400base 5; one hand: 10 digits
Septenary40422661base 7: 8 digits
Nonary6301861base 9; each digit is two ternary digits: 7 digits
Duodecimal1164761base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal110i15base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:35:20:25base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T010001T00T001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101001010000101001001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100110110000100111001
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 odd
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes333 61 39
Gray code1010101101000110100101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100110110000100111001
64-bit0000000000000000000000000000000000000000001100110110000100111001
One's complement11111111110011001001111011000110at 32 bits, every bit flipped
Bits reversed10011100100001101100110000000000at 32 bits
Rotated left by 100000000011001101100001001110010at 32 bits, wrapping
Shifted left by 111001101100001001110010= 6,734,450, no wrap
Shifted right by 1110011011000010011100= 1,683,612, discarding the low bit
These bits as a double1.66363019 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,367,225 to the power 211,338,204,200,625
3,367,225 to the power 338,178,284,639,449,515,625
3,367,225 to the power 4128,554,874,495,070,395,250,390,625
3,367,225 to the power 5432,873,187,271,663,411,646,996,572,265,625
First ten multiples3,367,225, 6,734,450, 10,101,675, 13,468,900, 16,836,125, 20,203,350, 23,570,575, 26,937,800, 30,305,025, 33,672,250
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 1
Divisible by 5Yes
Divisible by 6No, remainder 1
Divisible by 7No, remainder 1
Divisible by 8No, remainder 1
Divisible by 9No, remainder 1
Divisible by 10No, remainder 5
Divisible by 11No, remainder 4
Divisible by 12No, remainder 1
Divisible by 100No, remainder 25
Collatz (3n + 1) trajectory
Steps to reach 1133the total stopping time
Highest value reached14,383,0604× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,367,225 → 10,101,676 → 5,050,838 → 2,525,419 → 7,576,258 → 3,788,129 → 11,364,388 → 5,682,194 → 2,841,097 → 8,523,292 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage336,722,500%
3,367,225% as a decimal33,672.25
3,367,225% of 1003,367,225
3,367,225% of 1,00033,672,250
As a fraction of 1003,367,225/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,367,225
Nerdulate something else
Nothing in mind? Surprise me · today’s page