Recognised as Number
3,319,335
- Positive
- Odd
- Composite
- 7 digits
3,319,335 is an odd 7-digit integer and a composite number. It has 24 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,319,335
Digit count7
Digit sum27
Digit product3,645
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3^2 × 5 × 17 × 4,339
Distinct prime factors43, 5, 17, 4,339
Number of divisors24
Sum of divisors σ(n)6,093,360
Aliquot sum2,774,025sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,665,792integers below n that share no factor with it
Carmichael function λ(n)34,704the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,665,792
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 5, 9, 15, 17, 45, 51, 85, 153, 255, 765, 4,339, 13,017, 21,695, 39,051, 65,085, 73,763, 195,255, 221,289, 368,815, 663,867, 1,106,445, 3,319,33524 in total
Arithmetic
Previous number3,319,334
Next number3,319,336
Double6,638,670
Half1,659,667.5
Square11,017,984,842,225
Cube36,572,382,716,266,920,375
Square root1,821.904223608≈irrational, shown to 9 decimal places
Cube root149.170757494≈
Negation-3,319,335
Reciprocal3.01265163 × 10^-7≈
Representations
Decimal3,319,335
Binary110010101001100010011122 bits
Octal14523047
Hexadecimal32A627
Base 361Z57R
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, three hundred and nineteen thousand, three hundred and thirty-five
Ordinalthree million, three hundred and nineteen thousand, three hundred and thirty-fifth
Scientific notation3.319335 × 10^6
Engineering notation3.319335 × 10^6
In other bases
Ternary20020122021100base 3; the most digit-efficient integer base after e: 14 digits
Quinary1322204320base 5; one hand: 10 digits
Septenary40133235base 7: 8 digits
Nonary6218240base 9; each digit is two ternary digits: 7 digits
Duodecimal1140ab3base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal10ei6fbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:22:2:15base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T01T1T0T1T1100digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101111111101001111011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100101010011000100111
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
Bytes332 a6 27
Gray code1010111111010100110100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100101010011000100111
64-bit0000000000000000000000000000000000000000001100101010011000100111
One's complement11111111110011010101100111011000at 32 bits, every bit flipped
Bits reversed11100100011001010100110000000000at 32 bits
Rotated left by 100000000011001010100110001001110at 32 bits, wrapping
Shifted left by 111001010100110001001110= 6,638,670, no wrap
Shifted right by 1110010101001100010011= 1,659,667, discarding the low bit
These bits as a double1.63996939 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,319,335 to the power 211,017,984,842,225
3,319,335 to the power 336,572,382,716,266,920,375
3,319,335 to the power 4121,395,989,983,499,858,142,950,625
3,319,335 to the power 5402,953,958,411,880,501,628,931,012,834,375
First ten multiples3,319,335, 6,638,670, 9,958,005, 13,277,340, 16,596,675, 19,916,010, 23,235,345, 26,554,680, 29,874,015, 33,193,350
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5Yes
Divisible by 6No, remainder 3
Divisible by 7No, remainder 5
Divisible by 8No, remainder 7
Divisible by 9Yes
Divisible by 10No, remainder 5
Divisible by 11No, remainder 8
Divisible by 12No, remainder 3
Divisible by 100No, remainder 35
Collatz (3n + 1) trajectory
Steps to reach 1115the total stopping time
Highest value reached25,206,2087× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,319,335 → 9,958,006 → 4,979,003 → 14,937,010 → 7,468,505 → 22,405,516 → 11,202,758 → 5,601,379 → 16,804,138 → 8,402,069 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage331,933,500%
3,319,335% as a decimal33,193.35
3,319,335% of 1003,319,335
3,319,335% of 1,00033,193,350
As a fraction of 1003,319,335/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,319,335
Nerdulate something else
Nothing in mind? Surprise me · today’s page