Recognised as Number
3,367,739
- Positive
- Odd
- Composite
- 7 digits
3,367,739 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,367,739
Digit count7
Digit sum38
Digit product71,442
Multiplicative persistence4times 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 factorisation113 × 29,803
Distinct prime factors2113, 29,803
Number of divisors4
Sum of divisors σ(n)3,397,656
Aliquot sum29,917sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,337,824integers below n that share no factor with it
Carmichael function λ(n)1,668,912the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,337,824
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 113, 29,803, 3,367,7394 in total
Arithmetic
Previous number3,367,738
Next number3,367,740
Double6,735,478
Half1,683,869.5
Square11,341,665,972,121
Cube38,195,770,819,284,804,419
Square root1,835.140049152≈irrational, shown to 9 decimal places
Cube root149.892352395≈
Negation-3,367,739
Reciprocal2.96935125 × 10^-7≈
Representations
Decimal3,367,739
Binary110011011000110011101122 bits
Octal14661473
Hexadecimal33633B
Base 36206KB
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, three hundred and sixty-seven thousand, seven hundred and thirty-nine
Ordinalthree million, three hundred and sixty-seven thousand, seven hundred and thirty-ninth
Scientific notation3.367739 × 10^6
Engineering notation3.367739 × 10^6
In other bases
Ternary20100002200002base 3; the most digit-efficient integer base after e: 14 digits
Quinary1330231424base 5; one hand: 10 digits
Septenary40424324base 7: 8 digits
Nonary6302602base 9; each digit is two ternary digits: 7 digits
Duodecimal1164b0bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal110j6jbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:35:28:59base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0100010T0001Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101001010011101001111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100110110001100111011
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
Bytes333 63 3b
Gray code1010101101001010100110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100110110001100111011
64-bit0000000000000000000000000000000000000000001100110110001100111011
One's complement11111111110011001001110011000100at 32 bits, every bit flipped
Bits reversed11011100110001101100110000000000at 32 bits
Rotated left by 100000000011001101100011001110110at 32 bits, wrapping
Shifted left by 111001101100011001110110= 6,735,478, no wrap
Shifted right by 1110011011000110011101= 1,683,869, discarding the low bit
These bits as a double1.66388414 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,367,739 to the power 211,341,665,972,121
3,367,739 to the power 338,195,770,819,284,804,419
3,367,739 to the power 4128,633,387,023,167,387,949,238,641
3,367,739 to the power 5433,203,674,180,014,715,924,780,991,602,699
First ten multiples3,367,739, 6,735,478, 10,103,217, 13,470,956, 16,838,695, 20,206,434, 23,574,173, 26,941,912, 30,309,651, 33,677,390
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 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 3
Divisible by 9No, remainder 2
Divisible by 10No, remainder 9
Divisible by 11No, remainder 1
Divisible by 12No, remainder 11
Divisible by 100No, remainder 39
Collatz (3n + 1) trajectory
Steps to reach 171the total stopping time
Highest value reached17,049,1845× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,367,739 → 10,103,218 → 5,051,609 → 15,154,828 → 7,577,414 → 3,788,707 → 11,366,122 → 5,683,061 → 17,049,184 → 8,524,592 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage336,773,900%
3,367,739% as a decimal33,677.39
3,367,739% of 1003,367,739
3,367,739% of 1,00033,677,390
As a fraction of 1003,367,739/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,739
Nerdulate something else
Nothing in mind? Surprise me · today’s page