Recognised as Number
3,373,971
- Positive
- Odd
- Composite
- 7 digits
3,373,971 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,373,971
Digit count7
Digit sum33
Digit product11,907
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 61 × 103 × 179
Distinct prime factors43, 61, 103, 179
Number of divisors16
Sum of divisors σ(n)4,642,560
Aliquot sum1,268,589sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,178,720integers below n that share no factor with it
Carmichael function λ(n)90,780the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,178,720
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 61, 103, 179, 183, 309, 537, 6,283, 10,919, 18,437, 18,849, 32,757, 55,311, 1,124,657, 3,373,97116 in total
Arithmetic
Previous number3,373,970
Next number3,373,972
Double6,747,942
Half1,686,985.5
Square11,383,680,308,841
Cube38,408,207,235,300,577,611
Square root1,836.83722741≈irrational, shown to 9 decimal places
Cube root149.984754006≈
Negation-3,373,971
Reciprocal2.96386661 × 10^-7≈
Representations
Decimal3,373,971
Binary110011011110111001001122 bits
Octal14675623
Hexadecimal337B93
Base 3620BDF
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, three hundred and seventy-three thousand, nine hundred and seventy-one
Ordinalthree million, three hundred and seventy-three thousand, nine hundred and seventy-first
Scientific notation3.373971 × 10^6
Engineering notation3.373971 × 10^6
In other bases
Ternary20100102012220base 3; the most digit-efficient integer base after e: 14 digits
Quinary1330431341base 5; one hand: 10 digits
Septenary40451436base 7: 8 digits
Nonary6312186base 9; each digit is two ternary digits: 7 digits
Duodecimal1168643base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal111eibbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:37:12:51base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T010011T1T00T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101001000110010010111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100110111101110010011
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 7b 93
Gray code1010101100011001011010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100110111101110010011
64-bit0000000000000000000000000000000000000000001100110111101110010011
One's complement11111111110011001000010001101100at 32 bits, every bit flipped
Bits reversed11001001110111101100110000000000at 32 bits
Rotated left by 100000000011001101111011100100110at 32 bits, wrapping
Shifted left by 111001101111011100100110= 6,747,942, no wrap
Shifted right by 1110011011110111001001= 1,686,985, discarding the low bit
These bits as a double1.66696316 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,373,971 to the power 211,383,680,308,841
3,373,971 to the power 338,408,207,235,300,577,611
3,373,971 to the power 4129,588,177,373,894,325,142,763,281
3,373,971 to the power 5437,226,752,402,375,610,096,254,169,958,851
First ten multiples3,373,971, 6,747,942, 10,121,913, 13,495,884, 16,869,855, 20,243,826, 23,617,797, 26,991,768, 30,365,739, 33,739,710
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 6
Divisible by 8No, remainder 3
Divisible by 9No, remainder 6
Divisible by 10No, remainder 1
Divisible by 11No, remainder 7
Divisible by 12No, remainder 3
Divisible by 100No, remainder 71
Collatz (3n + 1) trajectory
Steps to reach 1252the total stopping time
Highest value reached15,182,8724× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,373,971 → 10,121,914 → 5,060,957 → 15,182,872 → 7,591,436 → 3,795,718 → 1,897,859 → 5,693,578 → 2,846,789 → 8,540,368 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage337,397,100%
3,373,971% as a decimal33,739.71
3,373,971% of 1003,373,971
3,373,971% of 1,00033,739,710
As a fraction of 1003,373,971/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,971
Nerdulate something else
Nothing in mind? Surprise me · today’s page