Recognised as Number
3,293,801
- Positive
- Odd
- Composite
- 7 digits
3,293,801 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,293,801
Digit count7
Digit sum26
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation7 × 17 × 89 × 311
Distinct prime factors47, 17, 89, 311
Number of divisors16
Sum of divisors σ(n)4,043,520
Aliquot sum749,719sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,618,880integers below n that share no factor with it
Carmichael function λ(n)81,840the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,618,880
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 7, 17, 89, 119, 311, 623, 1,513, 2,177, 5,287, 10,591, 27,679, 37,009, 193,753, 470,543, 3,293,80116 in total
Arithmetic
Previous number3,293,800
Next number3,293,802
Double6,587,602
Half1,646,900.5
Square10,849,125,027,601
Cube35,734,858,865,037,201,401
Square root1,814.883191834≈irrational, shown to 9 decimal places
Cube root148.787273572≈
Negation-3,293,801
Reciprocal3.03600612 × 10^-7≈
Representations
Decimal3,293,801
Binary110010010000100110100122 bits
Octal14441151
Hexadecimal324269
Base 361YLIH
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, two hundred and ninety-three thousand, eight hundred and one
Ordinalthree million, two hundred and ninety-three thousand, eight hundred and first
Scientific notation3.293801 × 10^6
Engineering notation3.293801 × 10^6
In other bases
Ternary20012100020122base 3; the most digit-efficient integer base after e: 14 digits
Quinary1320400201base 5; one hand: 10 digits
Septenary36665630base 7: 8 digits
Nonary6170218base 9; each digit is two ternary digits: 7 digits
Duodecimal112a175base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal10bea1base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:14:56:41base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T01TT1001T1T0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101100100011110111001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100100100001001101001
Bit length22 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits13within that length
Bit parityodd9 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
Bytes332 42 69
Gray code1010110110001101011101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100100100001001101001
64-bit0000000000000000000000000000000000000000001100100100001001101001
One's complement11111111110011011011110110010110at 32 bits, every bit flipped
Bits reversed10010110010000100100110000000000at 32 bits
Rotated left by 100000000011001001000010011010010at 32 bits, wrapping
Shifted left by 111001001000010011010010= 6,587,602, no wrap
Shifted right by 1110010010000100110100= 1,646,900, discarding the low bit
These bits as a double1.62735392 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,293,801 to the power 210,849,125,027,601
3,293,801 to the power 335,734,858,865,037,201,401
3,293,801 to the power 4117,703,513,864,518,399,011,815,201
3,293,801 to the power 5387,691,951,670,464,567,183,515,920,869,001
First ten multiples3,293,801, 6,587,602, 9,881,403, 13,175,204, 16,469,005, 19,762,806, 23,056,607, 26,350,408, 29,644,209, 32,938,010
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 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7Yes
Divisible by 8No, remainder 1
Divisible by 9No, remainder 8
Divisible by 10No, remainder 1
Divisible by 11No, remainder 5
Divisible by 12No, remainder 5
Divisible by 100No, remainder 1
Collatz (3n + 1) trajectory
Steps to reach 1120the total stopping time
Highest value reached25,012,3127× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,293,801 → 9,881,404 → 4,940,702 → 2,470,351 → 7,411,054 → 3,705,527 → 11,116,582 → 5,558,291 → 16,674,874 → 8,337,437 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage329,380,100%
3,293,801% as a decimal32,938.01
3,293,801% of 1003,293,801
3,293,801% of 1,00032,938,010
As a fraction of 1003,293,801/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,293,801
Nerdulate something else
Nothing in mind? Surprise me · today’s page