Recognised as Number
3,380,387
- Positive
- Odd
- Prime
- 7 digits
3,380,387 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value3,380,387
Digit count7
Digit sum32
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3,380,387
Distinct prime factors13,380,387
Number of divisors2
Sum of divisors σ(n)3,380,388
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,380,386integers below n that share no factor with it
Carmichael function λ(n)3,380,386the 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,380,3872 in total
Arithmetic
Previous number3,380,386
Next number3,380,388
Double6,760,774
Half1,690,193.5
Square11,427,016,269,769
Cube38,627,737,247,115,620,603
Square root1,838.582878197≈irrational, shown to 9 decimal places
Cube root150.079764984≈
Negation-3,380,387
Reciprocal2.95824117 × 10^-7≈
Representations
Decimal3,380,387
Binary110011100101001010001122 bits
Octal14712243
Hexadecimal3394A3
Base 3620GBN
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, three hundred and eighty thousand, three hundred and eighty-seven
Ordinalthree million, three hundred and eighty thousand, three hundred and eighty-seventh
Scientific notation3.380387 × 10^6
Engineering notation3.380387 × 10^6
In other bases
Ternary20100202000112base 3; the most digit-efficient integer base after e: 14 digits
Quinary1331133022base 5; one hand: 10 digits
Septenary40506233base 7: 8 digits
Nonary6322015base 9; each digit is two ternary digits: 7 digits
Duodecimal11702abbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal112aj7base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:38:59:47base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0101T1T001TTTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101001001010111100111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100111001010010100011
Bit length22 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits11within that length
Bit parityodd11 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 94 a3
Gray code1010100101111011110010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100111001010010100011
64-bit0000000000000000000000000000000000000000001100111001010010100011
One's complement11111111110011000110101101011100at 32 bits, every bit flipped
Bits reversed11000101001010011100110000000000at 32 bits
Rotated left by 100000000011001110010100101000110at 32 bits, wrapping
Shifted left by 111001110010100101000110= 6,760,774, no wrap
Shifted right by 1110011100101001010001= 1,690,193, discarding the low bit
These bits as a double1.67013309 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,380,387 to the power 211,427,016,269,769
3,380,387 to the power 338,627,737,247,115,620,603
3,380,387 to the power 4130,576,700,829,565,431,383,313,361
3,380,387 to the power 5441,399,781,987,152,199,897,544,502,450,707
First ten multiples3,380,387, 6,760,774, 10,141,161, 13,521,548, 16,901,935, 20,282,322, 23,662,709, 27,043,096, 30,423,483, 33,803,870
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 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 3
Divisible by 8No, remainder 3
Divisible by 9No, remainder 5
Divisible by 10No, remainder 7
Divisible by 11No, remainder 10
Divisible by 12No, remainder 11
Divisible by 100No, remainder 87
Collatz (3n + 1) trajectory
Steps to reach 1159the total stopping time
Highest value reached15,211,7444× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,380,387 → 10,141,162 → 5,070,581 → 15,211,744 → 7,605,872 → 3,802,936 → 1,901,468 → 950,734 → 475,367 → 1,426,102 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage338,038,700%
3,380,387% as a decimal33,803.87
3,380,387% of 1003,380,387
3,380,387% of 1,00033,803,870
As a fraction of 1003,380,387/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,380,387
Nerdulate something else
Nothing in mind? Surprise me · today’s page