Recognised as Number
3,442,003
- Positive
- Odd
- Composite
- 7 digits
3,442,003 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,442,003
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 factorisation761 × 4,523
Distinct prime factors2761, 4,523
Number of divisors4
Sum of divisors σ(n)3,447,288
Aliquot sum5,285sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,436,720integers below n that share no factor with it
Carmichael function λ(n)90,440the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,436,720
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 761, 4,523, 3,442,0034 in total
Arithmetic
Previous number3,442,002
Next number3,442,004
Double6,884,006
Half1,721,001.5
Square11,847,384,652,009
Cube40,778,733,514,368,934,027
Square root1,855.263593132≈irrational, shown to 9 decimal places
Cube root150.986139687≈
Negation-3,442,003
Reciprocal2.90528509 × 10^-7≈
Representations
Decimal3,442,003
Binary110100100001010101001122 bits
Octal15102523
Hexadecimal348553
Base 3621RV7
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, four hundred and forty-two thousand and three
Ordinalthree million, four hundred and forty-two thousand and third
Scientific notation3.442003 × 10^6
Engineering notation3.442003 × 10^6
In other bases
Ternary20110212112121base 3; the most digit-efficient integer base after e: 14 digits
Quinary1340121003base 5; one hand: 10 digits
Septenary41153665base 7: 8 digits
Nonary6425477base 9; each digit is two ternary digits: 7 digits
Duodecimal119ba97base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal11a503base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal15:56:6:43base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T01110T0TT0TT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101011000010101010111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101001000010101010011
Bit length22 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits12within that length
Bit parityeven10 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
Bytes334 85 53
Gray code1011101100011111111010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101001000010101010011
64-bit0000000000000000000000000000000000000000001101001000010101010011
One's complement11111111110010110111101010101100at 32 bits, every bit flipped
Bits reversed11001010101000010010110000000000at 32 bits
Rotated left by 100000000011010010000101010100110at 32 bits, wrapping
Shifted left by 111010010000101010100110= 6,884,006, no wrap
Shifted right by 1110100100001010101001= 1,721,001, discarding the low bit
These bits as a double1.70057544 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,442,003 to the power 211,847,384,652,009
3,442,003 to the power 340,778,733,514,368,934,027
3,442,003 to the power 4140,360,523,092,658,414,027,736,081
3,442,003 to the power 5483,121,341,566,499,539,058,709,674,010,243
First ten multiples3,442,003, 6,884,006, 10,326,009, 13,768,012, 17,210,015, 20,652,018, 24,094,021, 27,536,024, 30,978,027, 34,420,030
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 5
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 3
Collatz (3n + 1) trajectory
Steps to reach 1190the total stopping time
Highest value reached99,241,68428× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,442,003 → 10,326,010 → 5,163,005 → 15,489,016 → 7,744,508 → 3,872,254 → 1,936,127 → 5,808,382 → 2,904,191 → 8,712,574 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage344,200,300%
3,442,003% as a decimal34,420.03
3,442,003% of 1003,442,003
3,442,003% of 1,00034,420,030
As a fraction of 1003,442,003/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,442,003
Nerdulate something else
Nothing in mind? Surprise me · today’s page