Recognised as Number
3,331,701
- Positive
- Odd
- Composite
- 7 digits
3,331,701 is an odd 7-digit integer and a composite number. It has 12 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,331,701
Digit count7
Digit sum18
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 × 41 × 9,029
Distinct prime factors33, 41, 9,029
Number of divisors12
Sum of divisors σ(n)4,930,380
Aliquot sum1,598,679sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,166,720integers below n that share no factor with it
Carmichael function λ(n)270,840the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,166,720
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 41, 123, 369, 9,029, 27,087, 81,261, 370,189, 1,110,567, 3,331,70112 in total
Arithmetic
Previous number3,331,700
Next number3,331,702
Double6,663,402
Half1,665,850.5
Square11,100,231,553,401
Cube36,982,652,566,697,665,101
Square root1,825.294770715≈irrational, shown to 9 decimal places
Cube root149.355770416≈
Negation-3,331,701
Reciprocal3.00146982 × 10^-7≈
Representations
Decimal3,331,701
Binary110010110101100111010122 bits
Octal14553165
Hexadecimal32D675
Base 361ZER9
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, three hundred and thirty-one thousand, seven hundred and one
Ordinalthree million, three hundred and thirty-one thousand, seven hundred and first
Scientific notation3.331701 × 10^6
Engineering notation3.331701 × 10^6
In other bases
Ternary20021021020100base 3; the most digit-efficient integer base after e: 14 digits
Quinary1323103301base 5; one hand: 10 digits
Septenary40214262base 7: 8 digits
Nonary6237210base 9; each digit is two ternary digits: 7 digits
Duodecimal1148099base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal10g951base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:25:28:21base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T01T11T11T0100digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101110010101110110101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100101101011001110101
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 d6 75
Gray code1010111011110101001111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100101101011001110101
64-bit0000000000000000000000000000000000000000001100101101011001110101
One's complement11111111110011010010100110001010at 32 bits, every bit flipped
Bits reversed10101110011010110100110000000000at 32 bits
Rotated left by 100000000011001011010110011101010at 32 bits, wrapping
Shifted left by 111001011010110011101010= 6,663,402, no wrap
Shifted right by 1110010110101100111010= 1,665,850, discarding the low bit
These bits as a double1.64607901 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,331,701 to the power 211,100,231,553,401
3,331,701 to the power 336,982,652,566,697,665,101
3,331,701 to the power 4123,215,140,539,119,177,514,666,801
3,331,701 to the power 5410,516,006,949,323,902,844,792,895,558,501
First ten multiples3,331,701, 6,663,402, 9,995,103, 13,326,804, 16,658,505, 19,990,206, 23,321,907, 26,653,608, 29,985,309, 33,317,010
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 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 2
Divisible by 8No, remainder 5
Divisible by 9Yes
Divisible by 10No, remainder 1
Divisible by 11No, remainder 10
Divisible by 12No, remainder 9
Divisible by 100No, remainder 1
Collatz (3n + 1) trajectory
Steps to reach 1190the total stopping time
Highest value reached13,508,6924× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,331,701 → 9,995,104 → 4,997,552 → 2,498,776 → 1,249,388 → 624,694 → 312,347 → 937,042 → 468,521 → 1,405,564 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage333,170,100%
3,331,701% as a decimal33,317.01
3,331,701% of 1003,331,701
3,331,701% of 1,00033,317,010
As a fraction of 1003,331,701/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,331,701
Nerdulate something else
Nothing in mind? Surprise me · today’s page