Recognised as Number
3,368,601
- Positive
- Odd
- Composite
- 7 digits
3,368,601 is an odd 7-digit integer and a composite number. It has 32 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,368,601
Digit count7
Digit sum27
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberYesdivisible by its own digit sum
Factors & divisors
Prime factorisation3^3 × 17 × 41 × 179
Distinct prime factors43, 17, 41, 179
Number of divisors32
Sum of divisors σ(n)5,443,200
Aliquot sum2,074,599sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,050,560integers below n that share no factor with it
Carmichael function λ(n)64,080the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,050,560
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 17, 27, 41, 51, 123, 153, 179, 369, 459, 537, 697, 1,107, 1,611, 2,091, 3,043, 4,833, 6,273, 7,339, 9,129, 18,819, 22,017, 27,387, 66,051, 82,161, 124,763, 198,153, 374,289, 1,122,867, 3,368,60132 in total
Arithmetic
Previous number3,368,600
Next number3,368,602
Double6,737,202
Half1,684,300.5
Square11,347,472,697,201
Cube38,225,107,875,263,985,801
Square root1,835.374893584≈irrational, shown to 9 decimal places
Cube root149.905140023≈
Negation-3,368,601
Reciprocal2.96859141 × 10^-7≈
Representations
Decimal3,368,601
Binary110011011001101001100122 bits
Octal14663231
Hexadecimal336699
Base 3620789
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, three hundred and sixty-eight thousand, six hundred and one
Ordinalthree million, three hundred and sixty-eight thousand, six hundred and first
Scientific notation3.368601 × 10^6
Engineering notation3.368601 × 10^6
In other bases
Ternary20100010212000base 3; the most digit-efficient integer base after e: 14 digits
Quinary1330243401base 5; one hand: 10 digits
Septenary40426665base 7: 8 digits
Nonary6303760base 9; each digit is two ternary digits: 7 digits
Duodecimal1165509base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1111a1base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:35:43:21base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T01000110TT000digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101001011101111101001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100110110011010011001
Bit length22 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits10within that length
Bit parityeven12 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 66 99
Gray code1010101101010111010101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100110110011010011001
64-bit0000000000000000000000000000000000000000001100110110011010011001
One's complement11111111110011001001100101100110at 32 bits, every bit flipped
Bits reversed10011001011001101100110000000000at 32 bits
Rotated left by 100000000011001101100110100110010at 32 bits, wrapping
Shifted left by 111001101100110100110010= 6,737,202, no wrap
Shifted right by 1110011011001101001100= 1,684,300, discarding the low bit
These bits as a double1.66431003 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,368,601 to the power 211,347,472,697,201
3,368,601 to the power 338,225,107,875,263,985,801
3,368,601 to the power 4128,765,136,613,722,137,833,234,401
3,368,601 to the power 5433,758,367,962,121,007,227,171,236,443,001
First ten multiples3,368,601, 6,737,202, 10,105,803, 13,474,404, 16,843,005, 20,211,606, 23,580,207, 26,948,808, 30,317,409, 33,686,010
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 5
Divisible by 8No, remainder 1
Divisible by 9Yes
Divisible by 10No, remainder 1
Divisible by 11No, remainder 5
Divisible by 12No, remainder 9
Divisible by 100No, remainder 1
Collatz (3n + 1) trajectory
Steps to reach 1133the total stopping time
Highest value reached11,369,0323× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,368,601 → 10,105,804 → 5,052,902 → 2,526,451 → 7,579,354 → 3,789,677 → 11,369,032 → 5,684,516 → 2,842,258 → 1,421,129 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage336,860,100%
3,368,601% as a decimal33,686.01
3,368,601% of 1003,368,601
3,368,601% of 1,00033,686,010
As a fraction of 1003,368,601/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,368,601
Nerdulate something else
Nothing in mind? Surprise me · today’s page