Recognised as Number
3,380,317
- Positive
- Odd
- Prime
- 7 digits
3,380,317 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value3,380,317
Digit count7
Digit sum25
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3,380,317
Distinct prime factors13,380,317
Number of divisors2
Sum of divisors σ(n)3,380,318
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,380,316integers below n that share no factor with it
Carmichael function λ(n)3,380,316the 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,3172 in total
Arithmetic
Previous number3,380,316
Next number3,380,318
Double6,760,634
Half1,690,158.5
Square11,426,543,020,489
Cube38,625,337,623,390,315,013
Square root1,838.563841698≈irrational, shown to 9 decimal places
Cube root150.078729041≈
Negation-3,380,317
Reciprocal2.95830243 × 10^-7≈
Representations
Decimal3,380,317
Binary110011100101000101110122 bits
Octal14712135
Hexadecimal33945D
Base 3620G9P
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, three hundred and eighty thousand, three hundred and seventeen
Ordinalthree million, three hundred and eighty thousand, three hundred and seventeenth
Scientific notation3.380317 × 10^6
Engineering notation3.380317 × 10^6
In other bases
Ternary20100201220221base 3; the most digit-efficient integer base after e: 14 digits
Quinary1331132232base 5; one hand: 10 digits
Septenary40506103base 7: 8 digits
Nonary6321827base 9; each digit is two ternary digits: 7 digits
Duodecimal1170251base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal112afhbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:38:58:37base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0101T1T0T10T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101001001010110101101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100111001010001011101
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 94 5d
Gray code1010100101111001110011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100111001010001011101
64-bit0000000000000000000000000000000000000000001100111001010001011101
One's complement11111111110011000110101110100010at 32 bits, every bit flipped
Bits reversed10111010001010011100110000000000at 32 bits
Rotated left by 100000000011001110010100010111010at 32 bits, wrapping
Shifted left by 111001110010100010111010= 6,760,634, no wrap
Shifted right by 1110011100101000101110= 1,690,158, discarding the low bit
These bits as a double1.6700985 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,380,317 to the power 211,426,543,020,489
3,380,317 to the power 338,625,337,623,390,315,013
3,380,317 to the power 4130,565,885,399,085,879,473,799,121
3,380,317 to the power 5441,354,082,034,581,782,845,234,223,301,357
First ten multiples3,380,317, 6,760,634, 10,140,951, 13,521,268, 16,901,585, 20,281,902, 23,662,219, 27,042,536, 30,422,853, 33,803,170
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 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 3
Divisible by 8No, remainder 5
Divisible by 9No, remainder 7
Divisible by 10No, remainder 7
Divisible by 11No, remainder 6
Divisible by 12No, remainder 1
Divisible by 100No, remainder 17
Collatz (3n + 1) trajectory
Steps to reach 1107the total stopping time
Highest value reached10,140,9523× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,380,317 → 10,140,952 → 5,070,476 → 2,535,238 → 1,267,619 → 3,802,858 → 1,901,429 → 5,704,288 → 2,852,144 → 1,426,072 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage338,031,700%
3,380,317% as a decimal33,803.17
3,380,317% of 1003,380,317
3,380,317% of 1,00033,803,170
As a fraction of 1003,380,317/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,317
Nerdulate something else
Nothing in mind? Surprise me · today’s page