Recognised as Number
3,200,443
- Positive
- Odd
- Prime
- 7 digits
3,200,443 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value3,200,443
Digit count7
Digit sum16
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3,200,443
Distinct prime factors13,200,443
Number of divisors2
Sum of divisors σ(n)3,200,444
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,200,442integers below n that share no factor with it
Carmichael function λ(n)3,200,442the 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,200,4432 in total
Arithmetic
Previous number3,200,442
Next number3,200,444
Double6,400,886
Half1,600,221.5
Square10,242,835,396,249
Cube32,781,610,844,077,338,307
Square root1,788.978199979≈irrational, shown to 9 decimal places
Cube root147.36805974≈
Negation-3,200,443
Reciprocal3.12456744 × 10^-7≈
Representations
Decimal3,200,443
Binary110000110101011011101122 bits
Octal14152673
Hexadecimal30D5BB
Base 361WLH7
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, two hundred thousand, four hundred and forty-three
Ordinalthree million, two hundred thousand, four hundred and forty-third
Scientific notation3.200443 × 10^6
Engineering notation3.200443 × 10^6
In other bases
Ternary20000121011221base 3; the most digit-efficient integer base after e: 14 digits
Quinary1304403233base 5; one hand: 10 digits
Septenary36126511base 7: 8 digits
Nonary6017157base 9; each digit is two ternary digits: 7 digits
Duodecimal10a4137base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal100123base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal14:49:0:43base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0001TT11TT0T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11100010010101011001111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100001101010110111011
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
Bytes330 d5 bb
Gray code1010001011111101100110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100001101010110111011
64-bit0000000000000000000000000000000000000000001100001101010110111011
One's complement11111111110011110010101001000100at 32 bits, every bit flipped
Bits reversed11011101101010110000110000000000at 32 bits
Rotated left by 100000000011000011010101101110110at 32 bits, wrapping
Shifted left by 111000011010101101110110= 6,400,886, no wrap
Shifted right by 1110000110101011011101= 1,600,221, discarding the low bit
These bits as a double1.58122894 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,200,443 to the power 210,242,835,396,249
3,200,443 to the power 332,781,610,844,077,338,307
3,200,443 to the power 4104,915,676,954,651,408,843,270,001
3,200,443 to the power 5335,776,643,899,775,418,872,581,571,810,443
First ten multiples3,200,443, 6,400,886, 9,601,329, 12,801,772, 16,002,215, 19,202,658, 22,403,101, 25,603,544, 28,803,987, 32,004,430
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 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 1
Divisible by 8No, remainder 3
Divisible by 9No, remainder 7
Divisible by 10No, remainder 3
Divisible by 11No, remainder 4
Divisible by 12No, remainder 7
Divisible by 100No, remainder 43
Collatz (3n + 1) trajectory
Steps to reach 1164the total stopping time
Highest value reached16,202,2485× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,200,443 → 9,601,330 → 4,800,665 → 14,401,996 → 7,200,998 → 3,600,499 → 10,801,498 → 5,400,749 → 16,202,248 → 8,101,124 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage320,044,300%
3,200,443% as a decimal32,004.43
3,200,443% of 1003,200,443
3,200,443% of 1,00032,004,430
As a fraction of 1003,200,443/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,200,443
Nerdulate something else
Nothing in mind? Surprise me · today’s page