Recognised as Number
3,373,181
- Positive
- Odd
- Composite
- 7 digits
3,373,181 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,373,181
Digit count7
Digit sum26
Digit product1,512
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation7 × 481,883
Distinct prime factors27, 481,883
Number of divisors4
Sum of divisors σ(n)3,855,072
Aliquot sum481,891sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,891,292integers below n that share no factor with it
Carmichael function λ(n)1,445,646the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,891,292
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 7, 481,883, 3,373,1814 in total
Arithmetic
Previous number3,373,180
Next number3,373,182
Double6,746,362
Half1,686,590.5
Square11,378,350,058,761
Cube38,381,234,229,561,488,741
Square root1,836.62217127≈irrational, shown to 9 decimal places
Cube root149.973047009≈
Negation-3,373,181
Reciprocal2.96456075 × 10^-7≈
Representations
Decimal3,373,181
Binary110011011110000111110122 bits
Octal14674175
Hexadecimal33787D
Base 3620ARH
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, three hundred and seventy-three thousand, one hundred and eighty-one
Ordinalthree million, three hundred and seventy-three thousand, one hundred and eighty-first
Scientific notation3.373181 × 10^6
Engineering notation3.373181 × 10^6
In other bases
Ternary20100101010122base 3; the most digit-efficient integer base after e: 14 digits
Quinary1330420211base 5; one hand: 10 digits
Septenary40446230base 7: 8 digits
Nonary6311118base 9; each digit is two ternary digits: 7 digits
Duodecimal11680a5base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal111cj1base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:36:59:41base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0100101011T0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101001000100110001101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100110111100001111101
Bit length22 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits8within that length
Bit parityeven14 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 78 7d
Gray code1010101100010001000011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100110111100001111101
64-bit0000000000000000000000000000000000000000001100110111100001111101
One's complement11111111110011001000011110000010at 32 bits, every bit flipped
Bits reversed10111110000111101100110000000000at 32 bits
Rotated left by 100000000011001101111000011111010at 32 bits, wrapping
Shifted left by 111001101111000011111010= 6,746,362, no wrap
Shifted right by 1110011011110000111110= 1,686,590, discarding the low bit
These bits as a double1.66657285 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,373,181 to the power 211,378,350,058,761
3,373,181 to the power 338,381,234,229,561,488,741
3,373,181 to the power 4129,466,850,059,706,452,152,855,121
3,373,181 to the power 5436,715,118,751,250,669,979,419,989,909,901
First ten multiples3,373,181, 6,746,362, 10,119,543, 13,492,724, 16,865,905, 20,239,086, 23,612,267, 26,985,448, 30,358,629, 33,731,810
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 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7Yes
Divisible by 8No, remainder 5
Divisible by 9No, remainder 8
Divisible by 10No, remainder 1
Divisible by 11No, remainder 9
Divisible by 12No, remainder 5
Divisible by 100No, remainder 81
Collatz (3n + 1) trajectory
Steps to reach 1133the total stopping time
Highest value reached69,238,96020× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,373,181 → 10,119,544 → 5,059,772 → 2,529,886 → 1,264,943 → 3,794,830 → 1,897,415 → 5,692,246 → 2,846,123 → 8,538,370 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage337,318,100%
3,373,181% as a decimal33,731.81
3,373,181% of 1003,373,181
3,373,181% of 1,00033,731,810
As a fraction of 1003,373,181/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,373,181
Nerdulate something else
Nothing in mind? Surprise me · today’s page