Recognised as Number
3,003,443
- Positive
- Odd
- Composite
- 7 digits
3,003,443 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,003,443
Digit count7
Digit sum17
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 factorisation29 × 103,567
Distinct prime factors229, 103,567
Number of divisors4
Sum of divisors σ(n)3,107,040
Aliquot sum103,597sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,899,848integers below n that share no factor with it
Carmichael function λ(n)1,449,924the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,899,848
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 29, 103,567, 3,003,4434 in total
Arithmetic
Previous number3,003,442
Next number3,003,444
Double6,006,886
Half1,501,721.5
Square9,020,669,854,249
Cube27,093,067,729,055,179,307
Square root1,733.044431052≈irrational, shown to 9 decimal places
Cube root144.280109996≈
Negation-3,003,443
Reciprocal3.32951216 × 10^-7≈
Representations
Decimal3,003,443
Binary101101110101000011001122 bits
Octal13352063
Hexadecimal2DD433
Base 361SDGZ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, three thousand, four hundred and forty-three
Ordinalthree million, three thousand, four hundred and forty-third
Scientific notation3.003443 × 10^6
Engineering notation3.003443 × 10^6
In other bases
Ternary12122120221122base 3; the most digit-efficient integer base after e: 14 digits
Quinary1232102233base 5; one hand: 10 digits
Septenary34346252base 7: 8 digits
Nonary5576848base 9; each digit is two ternary digits: 7 digits
Duodecimal100a12bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimalif8c3base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal13:54:17:23base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0T00TT100TT0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11100101101010001110111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001011011101010000110011
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
Bytes32d d4 33
Gray code1110110011111000101010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001011011101010000110011
64-bit0000000000000000000000000000000000000000001011011101010000110011
One's complement11111111110100100010101111001100at 32 bits, every bit flipped
Bits reversed11001100001010111011010000000000at 32 bits
Rotated left by 100000000010110111010100001100110at 32 bits, wrapping
Shifted left by 110110111010100001100110= 6,006,886, no wrap
Shifted right by 1101101110101000011001= 1,501,721, discarding the low bit
These bits as a double1.48389801 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,003,443 to the power 29,020,669,854,249
3,003,443 to the power 327,093,067,729,055,179,307
3,003,443 to the power 481,372,484,619,356,674,903,354,001
3,003,443 to the power 5244,397,619,322,614,469,741,754,250,825,443
First ten multiples3,003,443, 6,006,886, 9,010,329, 12,013,772, 15,017,215, 18,020,658, 21,024,101, 24,027,544, 27,030,987, 30,034,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 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 2
Divisible by 8No, remainder 3
Divisible by 9No, remainder 8
Divisible by 10No, remainder 3
Divisible by 11No, remainder 3
Divisible by 12No, remainder 11
Divisible by 100No, remainder 43
Collatz (3n + 1) trajectory
Steps to reach 1138the total stopping time
Highest value reached13,515,4964× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,003,443 → 9,010,330 → 4,505,165 → 13,515,496 → 6,757,748 → 3,378,874 → 1,689,437 → 5,068,312 → 2,534,156 → 1,267,078 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage300,344,300%
3,003,443% as a decimal30,034.43
3,003,443% of 1003,003,443
3,003,443% of 1,00030,034,430
As a fraction of 1003,003,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,003,443
Nerdulate something else
Nothing in mind? Surprise me · today’s page