Recognised as Number
3,381,247
- Positive
- Odd
- Composite
- 7 digits
3,381,247 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,381,247
Digit count7
Digit sum28
Digit product4,032
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation1,069 × 3,163
Distinct prime factors21,069, 3,163
Number of divisors4
Sum of divisors σ(n)3,385,480
Aliquot sum4,233sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,377,016integers below n that share no factor with it
Carmichael function λ(n)562,836the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,377,016
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 1,069, 3,163, 3,381,2474 in total
Arithmetic
Previous number3,381,246
Next number3,381,248
Double6,762,494
Half1,690,623.5
Square11,432,831,275,009
Cube38,657,226,450,130,356,223
Square root1,838.816739102≈irrational, shown to 9 decimal places
Cube root150.092491106≈
Negation-3,381,247
Reciprocal2.95748876 × 10^-7≈
Representations
Decimal3,381,247
Binary110011100101111111111122 bits
Octal14713777
Hexadecimal3397FF
Base 3620GZJ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, three hundred and eighty-one thousand, two hundred and forty-seven
Ordinalthree million, three hundred and eighty-one thousand, two hundred and forty-seventh
Scientific notation3.381247 × 10^6
Engineering notation3.381247 × 10^6
In other bases
Ternary20100210012101base 3; the most digit-efficient integer base after e: 14 digits
Quinary1331144442base 5; one hand: 10 digits
Septenary40511602base 7: 8 digits
Nonary6323171base 9; each digit is two ternary digits: 7 digits
Duodecimal11708a7base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal112d27base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:39:14:7base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0101T101TT101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101001110100000000011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100111001011111111111
Bit length22 bitsto write the magnitude
Set bits17the population count, or Hamming weight
Zero bits5within that length
Bit parityodd17 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 97 ff
Gray code1010100101110000000000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100111001011111111111
64-bit0000000000000000000000000000000000000000001100111001011111111111
One's complement11111111110011000110100000000000at 32 bits, every bit flipped
Bits reversed11111111111010011100110000000000at 32 bits
Rotated left by 100000000011001110010111111111110at 32 bits, wrapping
Shifted left by 111001110010111111111110= 6,762,494, no wrap
Shifted right by 1110011100101111111111= 1,690,623, discarding the low bit
These bits as a double1.67055798 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,381,247 to the power 211,432,831,275,009
3,381,247 to the power 338,657,226,450,130,356,223
3,381,247 to the power 4130,709,630,962,823,916,587,950,081
3,381,247 to the power 5441,961,547,564,155,479,491,256,447,531,007
First ten multiples3,381,247, 6,762,494, 10,143,741, 13,524,988, 16,906,235, 20,287,482, 23,668,729, 27,049,976, 30,431,223, 33,812,470
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 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 2
Divisible by 8No, remainder 7
Divisible by 9No, remainder 1
Divisible by 10No, remainder 7
Divisible by 11No, remainder 1
Divisible by 12No, remainder 7
Divisible by 100No, remainder 47
Collatz (3n + 1) trajectory
Steps to reach 1252the total stopping time
Highest value reached584,939,392172× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,381,247 → 10,143,742 → 5,071,871 → 15,215,614 → 7,607,807 → 22,823,422 → 11,411,711 → 34,235,134 → 17,117,567 → 51,352,702 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage338,124,700%
3,381,247% as a decimal33,812.47
3,381,247% of 1003,381,247
3,381,247% of 1,00033,812,470
As a fraction of 1003,381,247/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,381,247
Nerdulate something else
Nothing in mind? Surprise me · today’s page