Recognised as Number
3,367,805
- Positive
- Odd
- Composite
- 7 digits
3,367,805 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,367,805
Digit count7
Digit sum32
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 numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation5 × 7 × 96,223
Distinct prime factors35, 7, 96,223
Number of divisors8
Sum of divisors σ(n)4,618,752
Aliquot sum1,250,947sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,309,328integers below n that share no factor with it
Carmichael function λ(n)192,444the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,309,328
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 5, 7, 35, 96,223, 481,115, 673,561, 3,367,8058 in total
Arithmetic
Previous number3,367,804
Next number3,367,806
Double6,735,610
Half1,683,902.5
Square11,342,110,518,025
Cube38,198,016,513,157,185,125
Square root1,835.158031342≈irrational, shown to 9 decimal places
Cube root149.893331571≈
Negation-3,367,805
Reciprocal2.96929306 × 10^-7≈
Representations
Decimal3,367,805
Binary110011011000110111110122 bits
Octal14661575
Hexadecimal33637D
Base 36206M5
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, three hundred and sixty-seven thousand, eight hundred and five
Ordinalthree million, three hundred and sixty-seven thousand, eight hundred and fifth
Scientific notation3.367805 × 10^6
Engineering notation3.367805 × 10^6
In other bases
Ternary20100002202112base 3; the most digit-efficient integer base after e: 14 digits
Quinary1330232210base 5; one hand: 10 digits
Septenary40424450base 7: 8 digits
Nonary6302675base 9; each digit is two ternary digits: 7 digits
Duodecimal1164b65base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal110ja5base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:35:30:5base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0100010T10TTTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101001010010010001101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100110110001101111101
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
Bytes333 63 7d
Gray code1010101101001011000011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100110110001101111101
64-bit0000000000000000000000000000000000000000001100110110001101111101
One's complement11111111110011001001110010000010at 32 bits, every bit flipped
Bits reversed10111110110001101100110000000000at 32 bits
Rotated left by 100000000011001101100011011111010at 32 bits, wrapping
Shifted left by 111001101100011011111010= 6,735,610, no wrap
Shifted right by 1110011011000110111110= 1,683,902, discarding the low bit
These bits as a double1.66391675 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,367,805 to the power 211,342,110,518,025
3,367,805 to the power 338,198,016,513,157,185,125
3,367,805 to the power 4128,643,471,003,093,333,849,900,625
3,367,805 to the power 5433,246,124,861,572,745,206,364,574,378,125
First ten multiples3,367,805, 6,735,610, 10,103,415, 13,471,220, 16,839,025, 20,206,830, 23,574,635, 26,942,440, 30,310,245, 33,678,050
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 1
Divisible by 5Yes
Divisible by 6No, remainder 5
Divisible by 7Yes
Divisible by 8No, remainder 5
Divisible by 9No, remainder 5
Divisible by 10No, remainder 5
Divisible by 11No, remainder 1
Divisible by 12No, remainder 5
Divisible by 100No, remainder 5
Collatz (3n + 1) trajectory
Steps to reach 1177the total stopping time
Highest value reached12,787,1443× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,367,805 → 10,103,416 → 5,051,708 → 2,525,854 → 1,262,927 → 3,788,782 → 1,894,391 → 5,683,174 → 2,841,587 → 8,524,762 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage336,780,500%
3,367,805% as a decimal33,678.05
3,367,805% of 1003,367,805
3,367,805% of 1,00033,678,050
As a fraction of 1003,367,805/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,805
Nerdulate something else
Nothing in mind? Surprise me · today’s page