Recognised as Number
3,329,931
- Positive
- Odd
- Composite
- 7 digits
3,329,931 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,329,931
Digit count7
Digit sum30
Digit product4,374
Multiplicative persistence5times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 11 × 100,907
Distinct prime factors33, 11, 100,907
Number of divisors8
Sum of divisors σ(n)4,843,584
Aliquot sum1,513,653sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,018,120integers below n that share no factor with it
Carmichael function λ(n)504,530the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,018,120
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 11, 33, 100,907, 302,721, 1,109,977, 3,329,9318 in total
Arithmetic
Previous number3,329,930
Next number3,329,932
Double6,659,862
Half1,664,965.5
Square11,088,440,464,761
Cube36,923,741,645,262,061,491
Square root1,824.809853108≈irrational, shown to 9 decimal places
Cube root149.329316808≈
Negation-3,329,931
Reciprocal3.00306523 × 10^-7≈
Representations
Decimal3,329,931
Binary110010110011111000101122 bits
Octal14547613
Hexadecimal32CF8B
Base 361ZDE3
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, three hundred and twenty-nine thousand, nine hundred and thirty-one
Ordinalthree million, three hundred and twenty-nine thousand, nine hundred and thirty-first
Scientific notation3.329931 × 10^6
Engineering notation3.329931 × 10^6
In other bases
Ternary20021011210210base 3; the most digit-efficient integer base after e: 14 digits
Quinary1323024211base 5; one hand: 10 digits
Septenary40206153base 7: 8 digits
Nonary6234723base 9; each digit is two ternary digits: 7 digits
Duodecimal1147063base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal10g4gbbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:24:58:51base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T01T11TTT11T10digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101111101000010011111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100101100111110001011
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 cf 8b
Gray code1010111010100001001110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100101100111110001011
64-bit0000000000000000000000000000000000000000001100101100111110001011
One's complement11111111110011010011000001110100at 32 bits, every bit flipped
Bits reversed11010001111100110100110000000000at 32 bits
Rotated left by 100000000011001011001111100010110at 32 bits, wrapping
Shifted left by 111001011001111100010110= 6,659,862, no wrap
Shifted right by 1110010110011111000101= 1,664,965, discarding the low bit
These bits as a double1.64520451 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,329,931 to the power 211,088,440,464,761
3,329,931 to the power 336,923,741,645,262,061,491
3,329,931 to the power 4122,953,511,940,549,141,682,787,121
3,329,931 to the power 5409,426,710,969,704,743,912,905,000,618,651
First ten multiples3,329,931, 6,659,862, 9,989,793, 13,319,724, 16,649,655, 19,979,586, 23,309,517, 26,639,448, 29,969,379, 33,299,310
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 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 3
Divisible by 8No, remainder 3
Divisible by 9No, remainder 3
Divisible by 10No, remainder 1
Divisible by 11Yes
Divisible by 12No, remainder 3
Divisible by 100No, remainder 31
Collatz (3n + 1) trajectory
Steps to reach 1177the total stopping time
Highest value reached14,984,6924× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,329,931 → 9,989,794 → 4,994,897 → 14,984,692 → 7,492,346 → 3,746,173 → 11,238,520 → 5,619,260 → 2,809,630 → 1,404,815 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage332,993,100%
3,329,931% as a decimal33,299.31
3,329,931% of 1003,329,931
3,329,931% of 1,00033,299,310
As a fraction of 1003,329,931/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,931
Nerdulate something else
Nothing in mind? Surprise me · today’s page