Recognised as Number
3,340,267
- Positive
- Odd
- Composite
- 7 digits
3,340,267 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,340,267
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 factorisation7 × 23 × 20,747
Distinct prime factors37, 23, 20,747
Number of divisors8
Sum of divisors σ(n)3,983,616
Aliquot sum643,349sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,738,472integers below n that share no factor with it
Carmichael function λ(n)62,238the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,738,472
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 7, 23, 161, 20,747, 145,229, 477,181, 3,340,2678 in total
Arithmetic
Previous number3,340,266
Next number3,340,268
Double6,680,534
Half1,670,133.5
Square11,157,383,631,289
Cube37,268,640,349,934,814,163
Square root1,827.63973474≈irrational, shown to 9 decimal places
Cube root149.483661708≈
Negation-3,340,267
Reciprocal2.99377265 × 10^-7≈
Representations
Decimal3,340,267
Binary110010111101111110101122 bits
Octal14573753
Hexadecimal32F7EB
Base 361ZLD7
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, three hundred and forty thousand, two hundred and sixty-seven
Ordinalthree million, three hundred and forty thousand, two hundred and sixty-seventh
Scientific notation3.340267 × 10^6
Engineering notation3.340267 × 10^6
In other bases
Ternary20021200222121base 3; the most digit-efficient integer base after e: 14 digits
Quinary1323342032base 5; one hand: 10 digits
Septenary40251250base 7: 8 digits
Nonary6250877base 9; each digit is two ternary digits: 7 digits
Duodecimal1151037base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal10had7base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:27:51:7base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T010TT01000TT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101110000100000111111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100101111011111101011
Bit length22 bitsto write the magnitude
Set bits16the population count, or Hamming weight
Zero bits6within that length
Bit parityeven16 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
Bytes332 f7 eb
Gray code1010111000110000011110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100101111011111101011
64-bit0000000000000000000000000000000000000000001100101111011111101011
One's complement11111111110011010000100000010100at 32 bits, every bit flipped
Bits reversed11010111111011110100110000000000at 32 bits
Rotated left by 100000000011001011110111111010110at 32 bits, wrapping
Shifted left by 111001011110111111010110= 6,680,534, no wrap
Shifted right by 1110010111101111110101= 1,670,133, discarding the low bit
These bits as a double1.65031117 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,340,267 to the power 211,157,383,631,289
3,340,267 to the power 337,268,640,349,934,814,163
3,340,267 to the power 4124,487,209,495,755,711,899,801,521
3,340,267 to the power 5415,820,517,800,759,444,520,414,327,146,107
First ten multiples3,340,267, 6,680,534, 10,020,801, 13,361,068, 16,701,335, 20,041,602, 23,381,869, 26,722,136, 30,062,403, 33,402,670
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 7Yes
Divisible by 8No, remainder 3
Divisible by 9No, remainder 7
Divisible by 10No, remainder 7
Divisible by 11No, remainder 7
Divisible by 12No, remainder 7
Divisible by 100No, remainder 67
Collatz (3n + 1) trajectory
Steps to reach 1115the total stopping time
Highest value reached28,535,8128× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,340,267 → 10,020,802 → 5,010,401 → 15,031,204 → 7,515,602 → 3,757,801 → 11,273,404 → 5,636,702 → 2,818,351 → 8,455,054 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage334,026,700%
3,340,267% as a decimal33,402.67
3,340,267% of 1003,340,267
3,340,267% of 1,00033,402,670
As a fraction of 1003,340,267/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,340,267
Nerdulate something else
Nothing in mind? Surprise me · today’s page