Recognised as Number
3,348,065
- Positive
- Odd
- Composite
- 7 digits
3,348,065 is an odd 7-digit integer and a composite number. It has 24 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,348,065
Digit count7
Digit sum29
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation5 × 7 × 17^2 × 331
Distinct prime factors45, 7, 17, 331
Number of divisors24
Sum of divisors σ(n)4,892,352
Aliquot sum1,544,287sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,154,240integers below n that share no factor with it
Carmichael function λ(n)44,880the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,154,240
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 5, 7, 17, 35, 85, 119, 289, 331, 595, 1,445, 1,655, 2,023, 2,317, 5,627, 10,115, 11,585, 28,135, 39,389, 95,659, 196,945, 478,295, 669,613, 3,348,06524 in total
Arithmetic
Previous number3,348,064
Next number3,348,066
Double6,696,130
Half1,674,032.5
Square11,209,539,244,225
Cube37,530,266,009,716,174,625
Square root1,829.771843701≈irrational, shown to 9 decimal places
Cube root149.599896694≈
Negation-3,348,065
Reciprocal2.98679984 × 10^-7≈
Representations
Decimal3,348,065
Binary110011000101100110000122 bits
Octal14613141
Hexadecimal331661
Base 361ZRDT
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, three hundred and forty-eight thousand and sixty-five
Ordinalthree million, three hundred and forty-eight thousand and sixty-fifth
Scientific notation3.348065 × 10^6
Engineering notation3.348065 × 10^6
In other bases
Ternary20022002200102base 3; the most digit-efficient integer base after e: 14 digits
Quinary1324114230base 5; one hand: 10 digits
Septenary40313060base 7: 8 digits
Nonary6262612base 9; each digit is two ternary digits: 7 digits
Duodecimal1155655base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal10ia35base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:30:1:5base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T010T010T0011Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101110110101110100001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100110001011001100001
Bit length22 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits12within that length
Bit parityeven10 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 16 61
Gray code1010101001110101010001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100110001011001100001
64-bit0000000000000000000000000000000000000000001100110001011001100001
One's complement11111111110011001110100110011110at 32 bits, every bit flipped
Bits reversed10000110011010001100110000000000at 32 bits
Rotated left by 100000000011001100010110011000010at 32 bits, wrapping
Shifted left by 111001100010110011000010= 6,696,130, no wrap
Shifted right by 1110011000101100110000= 1,674,032, discarding the low bit
These bits as a double1.6541639 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,348,065 to the power 211,209,539,244,225
3,348,065 to the power 337,530,266,009,716,174,625
3,348,065 to the power 4125,653,770,067,820,384,195,850,625
3,348,065 to the power 5420,696,989,682,117,054,612,680,622,790,625
First ten multiples3,348,065, 6,696,130, 10,044,195, 13,392,260, 16,740,325, 20,088,390, 23,436,455, 26,784,520, 30,132,585, 33,480,650
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 5Yes
Divisible by 6No, remainder 5
Divisible by 7Yes
Divisible by 8No, remainder 1
Divisible by 9No, remainder 2
Divisible by 10No, remainder 5
Divisible by 11No, remainder 6
Divisible by 12No, remainder 5
Divisible by 100No, remainder 65
Collatz (3n + 1) trajectory
Steps to reach 1115the total stopping time
Highest value reached12,712,1923× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,348,065 → 10,044,196 → 5,022,098 → 2,511,049 → 7,533,148 → 3,766,574 → 1,883,287 → 5,649,862 → 2,824,931 → 8,474,794 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage334,806,500%
3,348,065% as a decimal33,480.65
3,348,065% of 1003,348,065
3,348,065% of 1,00033,480,650
As a fraction of 1003,348,065/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,348,065
Nerdulate something else
Nothing in mind? Surprise me · today’s page