Recognised as Number
3,329,147
- Positive
- Odd
- Prime
- 7 digits
3,329,147 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value3,329,147
Digit count7
Digit sum29
Digit product4,536
Multiplicative persistence3times 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 factorisation3,329,147
Distinct prime factors13,329,147
Number of divisors2
Sum of divisors σ(n)3,329,148
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,329,146integers below n that share no factor with it
Carmichael function λ(n)3,329,146the 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,1472 in total
Arithmetic
Previous number3,329,146
Next number3,329,148
Double6,658,294
Half1,664,573.5
Square11,083,219,747,609
Cube36,897,667,773,093,259,523
Square root1,824.59502356≈irrational, shown to 9 decimal places
Cube root149.317596507≈
Negation-3,329,147
Reciprocal3.00377244 × 10^-7≈
Representations
Decimal3,329,147
Binary110010110011000111101122 bits
Octal14546173
Hexadecimal32CC7B
Base 361ZCSB
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, three hundred and twenty-nine thousand, one hundred and forty-seven
Ordinalthree million, three hundred and twenty-nine thousand, one hundred and forty-seventh
Scientific notation3.329147 × 10^6
Engineering notation3.329147 × 10^6
In other bases
Ternary20021010201202base 3; the most digit-efficient integer base after e: 14 digits
Quinary1323013042base 5; one hand: 10 digits
Septenary40203653base 7: 8 digits
Nonary6233652base 9; each digit is two ternary digits: 7 digits
Duodecimal114670bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal10g2h7base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:24:45:47base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T01T1011T1TT1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101111101110110001111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100101100110001111011
Bit length22 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits9within that length
Bit parityodd13 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 7b
Gray code1010111010101001000110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100101100110001111011
64-bit0000000000000000000000000000000000000000001100101100110001111011
One's complement11111111110011010011001110000100at 32 bits, every bit flipped
Bits reversed11011110001100110100110000000000at 32 bits
Rotated left by 100000000011001011001100011110110at 32 bits, wrapping
Shifted left by 111001011001100011110110= 6,658,294, no wrap
Shifted right by 1110010110011000111101= 1,664,573, discarding the low bit
These bits as a double1.64481716 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,329,147 to the power 211,083,219,747,609
3,329,147 to the power 336,897,667,773,093,259,523
3,329,147 to the power 4122,837,759,973,790,105,661,216,881
3,329,147 to the power 5408,944,960,103,463,408,891,723,195,730,507
First ten multiples3,329,147, 6,658,294, 9,987,441, 13,316,588, 16,645,735, 19,974,882, 23,304,029, 26,633,176, 29,962,323, 33,291,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 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 3
Divisible by 8No, remainder 3
Divisible by 9No, remainder 2
Divisible by 10No, remainder 7
Divisible by 11No, remainder 8
Divisible by 12No, remainder 11
Divisible by 100No, remainder 47
Collatz (3n + 1) trajectory
Steps to reach 1177the total stopping time
Highest value reached16,853,8125× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,329,147 → 9,987,442 → 4,993,721 → 14,981,164 → 7,490,582 → 3,745,291 → 11,235,874 → 5,617,937 → 16,853,812 → 8,426,906 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage332,914,700%
3,329,147% as a decimal33,291.47
3,329,147% of 1003,329,147
3,329,147% of 1,00033,291,470
As a fraction of 1003,329,147/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,147
Nerdulate something else
Nothing in mind? Surprise me · today’s page