Recognised as Number
3,336,667
- Positive
- Odd
- Composite
- 7 digits
3,336,667 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,336,667
Digit count7
Digit sum34
Digit product40,824
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation67 × 49,801
Distinct prime factors267, 49,801
Number of divisors4
Sum of divisors σ(n)3,386,536
Aliquot sum49,869sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,286,800integers below n that share no factor with it
Carmichael function λ(n)547,800the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,286,800
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 67, 49,801, 3,336,6674 in total
Arithmetic
Previous number3,336,666
Next number3,336,668
Double6,673,334
Half1,668,333.5
Square11,133,346,668,889
Cube37,148,270,429,641,852,963
Square root1,826.654592418≈irrational, shown to 9 decimal places
Cube root149.429939992≈
Negation-3,336,667
Reciprocal2.9970027 × 10^-7≈
Representations
Decimal3,336,667
Binary110010111010011101101122 bits
Octal14564733
Hexadecimal32E9DB
Base 361ZIL7
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, three hundred and thirty-six thousand, six hundred and sixty-seven
Ordinalthree million, three hundred and thirty-six thousand, six hundred and sixty-seventh
Scientific notation3.336667 × 10^6
Engineering notation3.336667 × 10^6
In other bases
Ternary20021112001021base 3; the most digit-efficient integer base after e: 14 digits
Quinary1323233132base 5; one hand: 10 digits
Septenary40234615base 7: 8 digits
Nonary6245037base 9; each digit is two ternary digits: 7 digits
Duodecimal114ab37base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal10h1d7base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:26:51:7base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T010TTTT0011T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101110011111000101111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100101110100111011011
Bit length22 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits8within that length
Bit parityeven14 set bits, so even; 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 e9 db
Gray code1010111001110100110110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100101110100111011011
64-bit0000000000000000000000000000000000000000001100101110100111011011
One's complement11111111110011010001011000100100at 32 bits, every bit flipped
Bits reversed11011011100101110100110000000000at 32 bits
Rotated left by 100000000011001011101001110110110at 32 bits, wrapping
Shifted left by 111001011101001110110110= 6,673,334, no wrap
Shifted right by 1110010111010011101101= 1,668,333, discarding the low bit
These bits as a double1.64853254 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,336,667 to the power 211,133,346,668,889
3,336,667 to the power 337,148,270,429,641,852,963
3,336,667 to the power 4123,951,408,049,661,792,600,494,321
3,336,667 to the power 5413,584,572,842,840,864,530,913,584,568,107
First ten multiples3,336,667, 6,673,334, 10,010,001, 13,346,668, 16,683,335, 20,020,002, 23,356,669, 26,693,336, 30,030,003, 33,366,670
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 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 5
Divisible by 8No, remainder 3
Divisible by 9No, remainder 7
Divisible by 10No, remainder 7
Divisible by 11No, remainder 4
Divisible by 12No, remainder 7
Divisible by 100No, remainder 67
Collatz (3n + 1) trajectory
Steps to reach 1164the total stopping time
Highest value reached40,586,34412× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,336,667 → 10,010,002 → 5,005,001 → 15,015,004 → 7,507,502 → 3,753,751 → 11,261,254 → 5,630,627 → 16,891,882 → 8,445,941 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage333,666,700%
3,336,667% as a decimal33,366.67
3,336,667% of 1003,336,667
3,336,667% of 1,00033,366,670
As a fraction of 1003,336,667/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,667
Nerdulate something else
Nothing in mind? Surprise me · today’s page