Recognised as Number
3,367,811
- Positive
- Odd
- Prime
- 7 digits
3,367,811 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,367,811
Digit count7
Digit sum29
Digit product3,024
Multiplicative persistence2times 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,367,811
Distinct prime factors13,367,811
Number of divisors2
Sum of divisors σ(n)3,367,812
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,367,810integers below n that share no factor with it
Carmichael function λ(n)3,367,810the 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,367,8112 in total
Arithmetic
Previous number3,367,810
Next number3,367,812
Double6,735,622
Half1,683,905.5
Square11,342,150,931,721
Cube38,198,220,671,510,232,731
Square root1,835.159666078≈irrational, shown to 9 decimal places
Cube root149.893420586≈
Negation-3,367,811
Reciprocal2.96928777 × 10^-7≈
Representations
Decimal3,367,811
Binary110011011000111000001122 bits
Octal14661603
Hexadecimal336383
Base 36206MB
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, three hundred and sixty-seven thousand, eight hundred and eleven
Ordinalthree million, three hundred and sixty-seven thousand, eight hundred and eleventh
Scientific notation3.367811 × 10^6
Engineering notation3.367811 × 10^6
In other bases
Ternary20100002202202base 3; the most digit-efficient integer base after e: 14 digits
Quinary1330232221base 5; one hand: 10 digits
Septenary40424456base 7: 8 digits
Nonary6302682base 9; each digit is two ternary digits: 7 digits
Duodecimal1164b6bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal110jabbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:35:30:11base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0100010T10T1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101001010010010000111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100110110001110000011
Bit length22 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits11within that length
Bit parityodd11 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
Bytes333 63 83
Gray code1010101101001001000010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100110110001110000011
64-bit0000000000000000000000000000000000000000001100110110001110000011
One's complement11111111110011001001110001111100at 32 bits, every bit flipped
Bits reversed11000001110001101100110000000000at 32 bits
Rotated left by 100000000011001101100011100000110at 32 bits, wrapping
Shifted left by 111001101100011100000110= 6,735,622, no wrap
Shifted right by 1110011011000111000001= 1,683,905, discarding the low bit
These bits as a double1.66391972 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,367,811 to the power 211,342,150,931,721
3,367,811 to the power 338,198,220,671,510,232,731
3,367,811 to the power 4128,644,387,757,939,548,404,021,841
3,367,811 to the power 5433,249,984,179,454,148,450,097,200,360,051
First ten multiples3,367,811, 6,735,622, 10,103,433, 13,471,244, 16,839,055, 20,206,866, 23,574,677, 26,942,488, 30,310,299, 33,678,110
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 6
Divisible by 8No, remainder 3
Divisible by 9No, remainder 2
Divisible by 10No, remainder 1
Divisible by 11No, remainder 7
Divisible by 12No, remainder 11
Divisible by 100No, remainder 11
Collatz (3n + 1) trajectory
Steps to reach 1159the total stopping time
Highest value reached15,361,9724× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,367,811 → 10,103,434 → 5,051,717 → 15,155,152 → 7,577,576 → 3,788,788 → 1,894,394 → 947,197 → 2,841,592 → 1,420,796 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage336,781,100%
3,367,811% as a decimal33,678.11
3,367,811% of 1003,367,811
3,367,811% of 1,00033,678,110
As a fraction of 1003,367,811/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,367,811
Nerdulate something else
Nothing in mind? Surprise me · today’s page