Recognised as Number
3,336,071
- Positive
- Odd
- Prime
- 7 digits
3,336,071 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value3,336,071
Digit count7
Digit sum23
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3,336,071
Distinct prime factors13,336,071
Number of divisors2
Sum of divisors σ(n)3,336,072
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,336,070integers below n that share no factor with it
Carmichael function λ(n)3,336,070the 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,336,0712 in total
Arithmetic
Previous number3,336,070
Next number3,336,072
Double6,672,142
Half1,668,035.5
Square11,129,369,717,041
Cube37,128,367,561,298,685,911
Square root1,826.491445367≈irrational, shown to 9 decimal places
Cube root149.421042336≈
Negation-3,336,071
Reciprocal2.99753812 × 10^-7≈
Representations
Decimal3,336,071
Binary110010111001111000011122 bits
Octal14563607
Hexadecimal32E787
Base 361ZI4N
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, three hundred and thirty-six thousand and seventy-one
Ordinalthree million, three hundred and thirty-six thousand and seventy-first
Scientific notation3.336071 × 10^6
Engineering notation3.336071 × 10^6
In other bases
Ternary20021111020012base 3; the most digit-efficient integer base after e: 14 digits
Quinary1323223241base 5; one hand: 10 digits
Septenary40233104base 7: 8 digits
Nonary6244205base 9; each digit is two ternary digits: 7 digits
Duodecimal114a71bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal10h03bbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:26:41:11base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T01T11111T01TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101110011100010011011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100101110011110000111
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 e7 87
Gray code1010111001010001000100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100101110011110000111
64-bit0000000000000000000000000000000000000000001100101110011110000111
One's complement11111111110011010001100001111000at 32 bits, every bit flipped
Bits reversed11100001111001110100110000000000at 32 bits
Rotated left by 100000000011001011100111100001110at 32 bits, wrapping
Shifted left by 111001011100111100001110= 6,672,142, no wrap
Shifted right by 1110010111001111000011= 1,668,035, discarding the low bit
These bits as a double1.64823807 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,336,071 to the power 211,129,369,717,041
3,336,071 to the power 337,128,367,561,298,685,911
3,336,071 to the power 4123,862,870,298,589,268,405,795,681
3,336,071 to the power 5413,215,329,579,884,999,239,791,203,309,351
First ten multiples3,336,071, 6,672,142, 10,008,213, 13,344,284, 16,680,355, 20,016,426, 23,352,497, 26,688,568, 30,024,639, 33,360,710
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 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 7
Divisible by 9No, remainder 5
Divisible by 10No, remainder 1
Divisible by 11No, remainder 2
Divisible by 12No, remainder 11
Divisible by 100No, remainder 71
Collatz (3n + 1) trajectory
Steps to reach 1190the total stopping time
Highest value reached22,518,4846× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,336,071 → 10,008,214 → 5,004,107 → 15,012,322 → 7,506,161 → 22,518,484 → 11,259,242 → 5,629,621 → 16,888,864 → 8,444,432 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage333,607,100%
3,336,071% as a decimal33,360.71
3,336,071% of 1003,336,071
3,336,071% of 1,00033,360,710
As a fraction of 1003,336,071/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,336,071
Nerdulate something else
Nothing in mind? Surprise me · today’s page