Recognised as Number
3,329,173
- Positive
- Odd
- Prime
- 7 digits
3,329,173 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value3,329,173
Digit count7
Digit sum28
Digit product3,402
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 factorisation3,329,173
Distinct prime factors13,329,173
Number of divisors2
Sum of divisors σ(n)3,329,174
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,329,172integers below n that share no factor with it
Carmichael function λ(n)3,329,172the 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,329,1732 in total
Arithmetic
Previous number3,329,172
Next number3,329,174
Double6,658,346
Half1,664,586.5
Square11,083,392,863,929
Cube36,898,532,270,985,100,717
Square root1,824.602148415≈irrational, shown to 9 decimal places
Cube root149.31798522≈
Negation-3,329,173
Reciprocal3.00374898 × 10^-7≈
Representations
Decimal3,329,173
Binary110010110011001001010122 bits
Octal14546225
Hexadecimal32CC95
Base 361ZCT1
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, three hundred and twenty-nine thousand, one hundred and seventy-three
Ordinalthree million, three hundred and twenty-nine thousand, one hundred and seventy-third
Scientific notation3.329173 × 10^6
Engineering notation3.329173 × 10^6
In other bases
Ternary20021010202201base 3; the most digit-efficient integer base after e: 14 digits
Quinary1323013143base 5; one hand: 10 digits
Septenary40204021base 7: 8 digits
Nonary6233681base 9; each digit is two ternary digits: 7 digits
Duodecimal1146731base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal10g2idbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:24:46:13base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T01T1011T10T01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101111101110110010101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100101100110010010101
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 cc 95
Gray code1010111010101011011111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100101100110010010101
64-bit0000000000000000000000000000000000000000001100101100110010010101
One's complement11111111110011010011001101101010at 32 bits, every bit flipped
Bits reversed10101001001100110100110000000000at 32 bits
Rotated left by 100000000011001011001100100101010at 32 bits, wrapping
Shifted left by 111001011001100100101010= 6,658,346, no wrap
Shifted right by 1110010110011001001010= 1,664,586, discarding the low bit
These bits as a double1.64483001 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,329,173 to the power 211,083,392,863,929
3,329,173 to the power 336,898,532,270,985,100,717
3,329,173 to the power 4122,841,597,376,192,280,709,317,041
3,329,173 to the power 5408,960,929,261,690,183,745,879,141,337,093
First ten multiples3,329,173, 6,658,346, 9,987,519, 13,316,692, 16,645,865, 19,975,038, 23,304,211, 26,633,384, 29,962,557, 33,291,730
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 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 1
Divisible by 8No, remainder 5
Divisible by 9No, remainder 1
Divisible by 10No, remainder 3
Divisible by 11No, remainder 1
Divisible by 12No, remainder 1
Divisible by 100No, remainder 73
Collatz (3n + 1) trajectory
Steps to reach 158the total stopping time
Highest value reached9,987,5203× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,329,173 → 9,987,520 → 4,993,760 → 2,496,880 → 1,248,440 → 624,220 → 312,110 → 156,055 → 468,166 → 234,083 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage332,917,300%
3,329,173% as a decimal33,291.73
3,329,173% of 1003,329,173
3,329,173% of 1,00033,291,730
As a fraction of 1003,329,173/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,329,173
Nerdulate something else
Nothing in mind? Surprise me · today’s page