Recognised as Number

3,388,581

Positive
Odd
Composite
7 digits

3,388,581 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value3,388,581

Digit count7

Digit sum36

Digit product23,040

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

Digital root9repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3^3 × 7 × 17,929

Distinct prime factors33, 7, 17,929

Number of divisors16

Sum of divisors σ(n)5,737,600

Aliquot sum2,349,019sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)1,936,224integers below n that share no factor with it

Carmichael function λ(n)17,928the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,936,224

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 3, 7, 9, 21, 27, 63, 189, 17,929, 53,787, 125,503, 161,361, 376,509, 484,083, 1,129,527, 3,388,58116 in total

Arithmetic

Previous number3,388,580

Next number3,388,582

Double6,777,162

Half1,694,290.5

Square11,482,481,193,561

Cube38,909,317,605,358,126,941

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

Cube root150.200930725≈

Negation-3,388,581

Reciprocal2.95108779 × 10^-7≈

Representations

Decimal3,388,581

Binary110011101101001010010122 bits

Octal14732245

Hexadecimal33B4A5

Base 3620MN9

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

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

Ordinalthree million, three hundred and eighty-eight thousand, five hundred and eighty-first

Scientific notation3.388581 × 10^6

Engineering notation3.388581 × 10^6

In other bases

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

Quinary1331413311base 5; one hand: 10 digits

Septenary40542150base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000001100111011010010100101

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 b4 a5

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

At each machine width

32-bit00000000001100111011010010100101

64-bit0000000000000000000000000000000000000000001100111011010010100101

One's complement11111111110011000100101101011010at 32 bits, every bit flipped

Bits reversed10100101001011011100110000000000at 32 bits

Rotated left by 100000000011001110110100101001010at 32 bits, wrapping

Shifted left by 111001110110100101001010= 6,777,162, no wrap

Shifted right by 1110011101101001010010= 1,694,290, discarding the low bit

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

Nearest landmarks

Next prime3,388,589+8

Previous prime3,388,573−8

Distance to nearest prime8

Nearest square below3,385,600

Nearest square above3,389,281

Powers & multiples

3,388,581 to the power 211,482,481,193,561

3,388,581 to the power 338,909,317,605,358,126,941

3,388,581 to the power 4131,847,374,360,482,047,147,860,721

3,388,581 to the power 5446,775,507,657,816,615,806,345,029,826,901

First ten multiples3,388,581, 6,777,162, 10,165,743, 13,554,324, 16,942,905, 20,331,486, 23,720,067, 27,108,648, 30,497,229, 33,885,810

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 1

Divisible by 5No, remainder 1

Divisible by 6No, remainder 3

Divisible by 7Yes

Divisible by 8No, remainder 5

Divisible by 9Yes

Divisible by 10No, remainder 1

Divisible by 11No, remainder 9

Divisible by 12No, remainder 9

Divisible by 100No, remainder 81

Collatz (3n + 1) trajectory

Steps to reach 1283the total stopping time

Highest value reached70,504,50420× the starting value

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

First steps3,388,581 → 10,165,744 → 5,082,872 → 2,541,436 → 1,270,718 → 635,359 → 1,906,078 → 953,039 → 2,859,118 → 1,429,559 → …

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

As a percentage & fraction

As a percentage338,858,100%

3,388,581% as a decimal33,885.81

3,388,581% of 1003,388,581

3,388,581% of 1,00033,885,810

As a fraction of 1003,388,581/100

Read another way

As seconds39 days, 5 hours and 16 minutes

As bytes3.232 MiB

As a 24-bit colour#33B4A5

Keep nerding

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