Recognised as Number

3,372,581

Positive
Odd
Prime
7 digits

3,372,581 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 2.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value3,372,581

Digit count7

Digit sum29

Digit product5,040

Multiplicative persistence2times the digit product can be taken before one digit is left

Digital root2repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3,372,581

Distinct prime factors13,372,581

Number of divisors2

Sum of divisors σ(n)3,372,582

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)3,372,580integers below n that share no factor with it

Carmichael function λ(n)3,372,580the smallest exponent with aˣ ≡ 1 for every unit coprime to n

Möbius function μ(n)−11 distinct prime factor, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 3,372,5812 in total

Arithmetic

Previous number3,372,580

Next number3,372,582

Double6,745,162

Half1,686,290.5

Square11,374,302,601,561

Cube38,360,756,842,275,198,941

Square root1,836.458820665≈irrational, shown to 9 decimal places

Cube root149.964154398≈

Negation-3,372,581

Reciprocal2.96508816 × 10^-7≈

Representations

Decimal3,372,581

Binary110011011101100010010122 bits

Octal14673045

Hexadecimal337625

Base 3620AAT

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordsthree million, three hundred and seventy-two thousand, five hundred and eighty-one

Ordinalthree million, three hundred and seventy-two thousand, five hundred and eighty-first

Scientific notation3.372581 × 10^6

Engineering notation3.372581 × 10^6

In other bases

Ternary20100100022102base 3; the most digit-efficient integer base after e: 14 digits

Quinary1330410311base 5; one hand: 10 digits

Septenary40444412base 7: 8 digits

Nonary6310272base 9; each digit is two ternary digits: 7 digits

Duodecimal1167885base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits

Vigesimal111b91base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits

Sexagesimal15:36:49:41base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

Balanced ternary1T010010010T11Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary11101001000101001100101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000001100110111011000100101

Bit length22 bitsto write the magnitude

Set bits12the population count, or Hamming weight

Zero bits10within that length

Bit parityeven12 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 76 25

Gray code1010101100110100110111n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000001100110111011000100101

64-bit0000000000000000000000000000000000000000001100110111011000100101

One's complement11111111110011001000100111011010at 32 bits, every bit flipped

Bits reversed10100100011011101100110000000000at 32 bits

Rotated left by 100000000011001101110110001001010at 32 bits, wrapping

Shifted left by 111001101110110001001010= 6,745,162, no wrap

Shifted right by 1110011011101100010010= 1,686,290, discarding the low bit

These bits as a double1.66627641 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime3,372,601+20

Previous prime3,372,547−34

Distance to nearest prime0, it is prime

Nearest square below3,370,896

Nearest square above3,374,569

Powers & multiples

3,372,581 to the power 211,374,302,601,561

3,372,581 to the power 338,360,756,842,275,198,941

3,372,581 to the power 4129,374,759,671,877,332,719,636,721

3,372,581 to the power 5436,326,856,348,939,726,660,925,132,146,901

First ten multiples3,372,581, 6,745,162, 10,117,743, 13,490,324, 16,862,905, 20,235,486, 23,608,067, 26,980,648, 30,353,229, 33,725,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 7No, remainder 2

Divisible by 8No, remainder 5

Divisible by 9No, remainder 2

Divisible by 10No, remainder 1

Divisible by 11No, remainder 3

Divisible by 12No, remainder 5

Divisible by 100No, remainder 81

Collatz (3n + 1) trajectory

Steps to reach 1133the total stopping time

Highest value reached10,117,7443× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps3,372,581 → 10,117,744 → 5,058,872 → 2,529,436 → 1,264,718 → 632,359 → 1,897,078 → 948,539 → 2,845,618 → 1,422,809 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage337,258,100%

3,372,581% as a decimal33,725.81

3,372,581% of 1003,372,581

3,372,581% of 1,00033,725,810

As a fraction of 1003,372,581/100

Read another way

As seconds39 days, 49 minutes and 41 seconds

As bytes3.216 MiB

As a 24-bit colour#337625

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.