Recognised as Number
3,372,583
- Positive
- Odd
- Composite
- 7 digits
3,372,583 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,372,583
Digit count7
Digit sum31
Digit product15,120
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberYesdivisible by its own digit sum
Factors & divisors
Prime factorisation31 × 108,793
Distinct prime factors231, 108,793
Number of divisors4
Sum of divisors σ(n)3,481,408
Aliquot sum108,825sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,263,760integers below n that share no factor with it
Carmichael function λ(n)543,960the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,263,760
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 31, 108,793, 3,372,5834 in total
Arithmetic
Previous number3,372,582
Next number3,372,584
Double6,745,166
Half1,686,291.5
Square11,374,316,091,889
Cube38,360,825,088,131,279,287
Square root1,836.459365192≈irrational, shown to 9 decimal places
Cube root149.964184041≈
Negation-3,372,583
Reciprocal2.9650864 × 10^-7≈
Representations
Decimal3,372,583
Binary110011011101100010011122 bits
Octal14673047
Hexadecimal337627
Base 3620AAV
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, three hundred and seventy-two thousand, five hundred and eighty-three
Ordinalthree million, three hundred and seventy-two thousand, five hundred and eighty-third
Scientific notation3.372583 × 10^6
Engineering notation3.372583 × 10^6
In other bases
Ternary20100100022111base 3; the most digit-efficient integer base after e: 14 digits
Quinary1330410313base 5; one hand: 10 digits
Septenary40444414base 7: 8 digits
Nonary6310274base 9; each digit is two ternary digits: 7 digits
Duodecimal1167887base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal111b93base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:36:49:43base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T010010010T111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101001000101001111011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100110111011000100111
Bit length22 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits9within that length
Bit parityodd13 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 76 27
Gray code1010101100110100110100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100110111011000100111
64-bit0000000000000000000000000000000000000000001100110111011000100111
One's complement11111111110011001000100111011000at 32 bits, every bit flipped
Bits reversed11100100011011101100110000000000at 32 bits
Rotated left by 100000000011001101110110001001110at 32 bits, wrapping
Shifted left by 111001101110110001001110= 6,745,166, no wrap
Shifted right by 1110011011101100010011= 1,686,291, discarding the low bit
These bits as a double1.6662774 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,372,583 to the power 211,374,316,091,889
3,372,583 to the power 338,360,825,088,131,279,287
3,372,583 to the power 4129,375,066,558,205,054,291,588,321
3,372,583 to the power 5436,328,150,098,070,876,617,887,814,403,143
First ten multiples3,372,583, 6,745,166, 10,117,749, 13,490,332, 16,862,915, 20,235,498, 23,608,081, 26,980,664, 30,353,247, 33,725,830
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 3
Divisible by 5No, remainder 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 4
Divisible by 8No, remainder 7
Divisible by 9No, remainder 4
Divisible by 10No, remainder 3
Divisible by 11No, remainder 5
Divisible by 12No, remainder 7
Divisible by 100No, remainder 83
Collatz (3n + 1) trajectory
Steps to reach 1133the total stopping time
Highest value reached25,610,5607× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,372,583 → 10,117,750 → 5,058,875 → 15,176,626 → 7,588,313 → 22,764,940 → 11,382,470 → 5,691,235 → 17,073,706 → 8,536,853 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage337,258,300%
3,372,583% as a decimal33,725.83
3,372,583% of 1003,372,583
3,372,583% of 1,00033,725,830
As a fraction of 1003,372,583/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,372,583
Nerdulate something else
Nothing in mind? Surprise me · today’s page