Recognised as Number
3,389,993
- Positive
- Odd
- Composite
- 7 digits
3,389,993 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,389,993
Digit count7
Digit sum44
Digit product157,464
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 factorisation23 × 147,391
Distinct prime factors223, 147,391
Number of divisors4
Sum of divisors σ(n)3,537,408
Aliquot sum147,415sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,242,580integers below n that share no factor with it
Carmichael function λ(n)1,621,290the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,242,580
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 23, 147,391, 3,389,9934 in total
Arithmetic
Previous number3,389,992
Next number3,389,994
Double6,779,986
Half1,694,996.5
Square11,492,052,540,049
Cube38,957,977,666,398,329,657
Square root1,841.193363012≈irrational, shown to 9 decimal places
Cube root150.221790417≈
Negation-3,389,993
Reciprocal2.9498586 × 10^-7≈
Representations
Decimal3,389,993
Binary110011101110100010100122 bits
Octal14735051
Hexadecimal33BA29
Base 3620NQH
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, three hundred and eighty-nine thousand, nine hundred and ninety-three
Ordinalthree million, three hundred and eighty-nine thousand, nine hundred and ninety-third
Scientific notation3.389993 × 10^6
Engineering notation3.389993 × 10^6
In other bases
Ternary20101020012022base 3; the most digit-efficient integer base after e: 14 digits
Quinary1331434433base 5; one hand: 10 digits
Septenary40546235base 7: 8 digits
Nonary6336168base 9; each digit is two ternary digits: 7 digits
Duodecimal1175975base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal113ejdbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:41:39:53base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T01011T01TT10Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101001100111001111001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100111011101000101001
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 ba 29
Gray code1010100110011100111101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100111011101000101001
64-bit0000000000000000000000000000000000000000001100111011101000101001
One's complement11111111110011000100010111010110at 32 bits, every bit flipped
Bits reversed10010100010111011100110000000000at 32 bits
Rotated left by 100000000011001110111010001010010at 32 bits, wrapping
Shifted left by 111001110111010001010010= 6,779,986, no wrap
Shifted right by 1110011101110100010100= 1,694,996, discarding the low bit
These bits as a double1.67487908 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,389,993 to the power 211,492,052,540,049
3,389,993 to the power 338,957,977,666,398,329,657
3,389,993 to the power 4132,067,271,583,246,672,748,922,401
3,389,993 to the power 5447,707,126,196,305,137,892,137,696,933,193
First ten multiples3,389,993, 6,779,986, 10,169,979, 13,559,972, 16,949,965, 20,339,958, 23,729,951, 27,119,944, 30,509,937, 33,899,930
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 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 5
Divisible by 8No, remainder 1
Divisible by 9No, remainder 8
Divisible by 10No, remainder 3
Divisible by 11No, remainder 2
Divisible by 12No, remainder 5
Divisible by 100No, remainder 93
Collatz (3n + 1) trajectory
Steps to reach 1252the total stopping time
Highest value reached43,440,92812× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,389,993 → 10,169,980 → 5,084,990 → 2,542,495 → 7,627,486 → 3,813,743 → 11,441,230 → 5,720,615 → 17,161,846 → 8,580,923 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage338,999,300%
3,389,993% as a decimal33,899.93
3,389,993% of 1003,389,993
3,389,993% of 1,00033,899,930
As a fraction of 1003,389,993/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,389,993
Nerdulate something else
Nothing in mind? Surprise me · today’s page