Nerdulator> put something in

Recognised as Number

3,550,743

  • Positive
  • Odd
  • Composite
  • 7 digits

3,550,743 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,550,743
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 numberYessquared-digit sums reach 1
Harshad numberYesdivisible by its own digit sum

Factors & divisors

Prime factorisation3^3 × 7 × 18,787
Distinct prime factors33, 7, 18,787
Number of divisors16
Sum of divisors σ(n)6,012,160
Aliquot sum2,461,417sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,028,888integers below n that share no factor with it
Carmichael function λ(n)56,358the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,028,888
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 7, 9, 21, 27, 63, 189, 18,787, 56,361, 131,509, 169,083, 394,527, 507,249, 1,183,581, 3,550,74316 in total

Arithmetic

Previous number3,550,742
Next number3,550,744
Double7,101,486
Cube44,766,971,852,232,022,407
Square root1,884.341529553≈irrational, shown to 9 decimal places
Cube root152.55967207≈
Negation-3,550,743
Reciprocal2.81631197 × 10^-7≈

Representations

Decimal3,550,743
Binary110110001011100001011122 bits
Octal15427027
Hexadecimal362E17
Base 36243RR
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, five hundred and fifty thousand, seven hundred and forty-three
Ordinalthree million, five hundred and fifty thousand, seven hundred and forty-third
Scientific notation3.550743 × 10^6
Engineering notation3.550743 × 10^6

In other bases

Ternary20200101201000base 3; the most digit-efficient integer base after e: 14 digits
Quinary1402110433base 5; one hand: 10 digits
Septenary42116010base 7: 8 digits
Nonary6611630base 9; each digit is two ternary digits: 7 digits
Duodecimal12329b3base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal123gh3base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:26:19:3base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1T0011TT01000digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010100111001001101011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000001101100010111000010111
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
Bytes336 2e 17
Gray code1011010011100100011100n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000001101100010111000010111
64-bit0000000000000000000000000000000000000000001101100010111000010111
One's complement11111111110010011101000111101000at 32 bits, every bit flipped
Bits reversed11101000011101000110110000000000at 32 bits
Rotated left by 100000000011011000101110000101110at 32 bits, wrapping
Shifted left by 111011000101110000101110= 7,101,486, no wrap
Shifted right by 1110110001011100001011= 1,775,371, discarding the low bit
These bits as a double1.75430013 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime3,550,751+8
Previous prime3,550,741−2
Distance to nearest prime2
Nearest square below3,549,456
Nearest square above3,553,225

Powers & multiples

3,550,743 to the power 212,607,775,852,049
3,550,743 to the power 344,766,971,852,232,022,407
3,550,743 to the power 4158,956,011,935,509,887,937,498,401
3,550,743 to the power 5564,411,946,687,928,186,024,856,884,861,943
First ten multiples3,550,743, 7,101,486, 10,652,229, 14,202,972, 17,753,715, 21,304,458, 24,855,201, 28,405,944, 31,956,687, 35,507,430
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 3
Divisible by 5No, remainder 3
Divisible by 6No, remainder 3
Divisible by 7Yes
Divisible by 8No, remainder 7
Divisible by 9Yes
Divisible by 10No, remainder 3
Divisible by 11No, remainder 9
Divisible by 12No, remainder 3
Divisible by 100No, remainder 43

Collatz (3n + 1) trajectory

Steps to reach 1190the total stopping time
Highest value reached23,967,5206× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,550,743 → 10,652,230 → 5,326,115 → 15,978,346 → 7,989,173 → 23,967,520 → 11,983,760 → 5,991,880 → 2,995,940 → 1,497,970 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage355,074,300%
3,550,743% as a decimal35,507.43
3,550,743% of 1003,550,743
3,550,743% of 1,00035,507,430
As a fraction of 1003,550,743/100

Read another way

As bytes3.386 MiB
As a 24-bit colour#362E17

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “3550743” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.