Recognised as Number
3,537,890
- Positive
- Even
- Composite
- 7 digits
3,537,890 is an even 7-digit integer and a composite number. It has 16 divisors and a digital root of 8.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value3,537,890
Digit count7
Digit sum35
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 factorisation2 × 5 × 41 × 8,629
Distinct prime factors42, 5, 41, 8,629
Number of divisors16
Sum of divisors σ(n)6,524,280
Aliquot sum2,986,390sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,380,480integers below n that share no factor with it
Carmichael function λ(n)86,280the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,380,480
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 5, 10, 41, 82, 205, 410, 8,629, 17,258, 43,145, 86,290, 353,789, 707,578, 1,768,945, 3,537,89016 in total
Arithmetic
Previous number3,537,889
Next number3,537,891
Double7,075,780
Half1,768,945
Square12,516,665,652,100
Cube44,282,586,243,908,069,000
Square root1,880.92796247≈irrational, shown to 9 decimal places
Cube root152.375370719≈
Negation-3,537,890
Reciprocal2.8265435 × 10^-7≈
Representations
Decimal3,537,890
Binary110101111110111110001022 bits
Octal15375742
Hexadecimal35FBE2
Base 3623TUQ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, five hundred and thirty-seven thousand, eight hundred and ninety
Ordinalthree million, five hundred and thirty-seven thousand, eight hundred and ninetieth
Scientific notation3.53789 × 10^6
Engineering notation3.53789 × 10^6
In other bases
Ternary20122202001222base 3; the most digit-efficient integer base after e: 14 digits
Quinary1401203030base 5; one hand: 10 digits
Septenary42033356base 7: 8 digits
Nonary6582058base 9; each digit is two ternary digits: 7 digits
Duodecimal1227482base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal1224eabase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:22:44:50base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1T00T1T01T00Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010100000110000100110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101011111101111100010
Bit length22 bitsto write the magnitude
Set bits15the population count, or Hamming weight
Zero bits7within that length
Bit parityodd15 set bits, so odd; not the same as the number itself being even
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes335 fb e2
Gray code1011110000011000010011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101011111101111100010
64-bit0000000000000000000000000000000000000000001101011111101111100010
One's complement11111111110010100000010000011101at 32 bits, every bit flipped
Bits reversed01000111110111111010110000000000at 32 bits
Rotated left by 100000000011010111111011111000100at 32 bits, wrapping
Shifted left by 111010111111011111000100= 7,075,780, no wrap
Shifted right by 1110101111110111110001= 1,768,945, discarding the low bit
These bits as a double1.74794991 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,537,890 to the power 212,516,665,652,100
3,537,890 to the power 344,282,586,243,908,069,000
3,537,890 to the power 4156,666,919,046,459,918,234,410,000
3,537,890 to the power 5554,270,326,225,280,080,122,336,794,900,000
First ten multiples3,537,890, 7,075,780, 10,613,670, 14,151,560, 17,689,450, 21,227,340, 24,765,230, 28,303,120, 31,841,010, 35,378,900
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4No, remainder 2
Divisible by 5Yes
Divisible by 6No, remainder 2
Divisible by 7No, remainder 6
Divisible by 8No, remainder 2
Divisible by 9No, remainder 8
Divisible by 10Yes
Divisible by 11No, remainder 4
Divisible by 12No, remainder 2
Divisible by 100No, remainder 90
Collatz (3n + 1) trajectory
Steps to reach 1128the total stopping time
Highest value reached5,306,8361× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,537,890 → 1,768,945 → 5,306,836 → 2,653,418 → 1,326,709 → 3,980,128 → 1,990,064 → 995,032 → 497,516 → 248,758 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage353,789,000%
3,537,890% as a decimal35,378.9
3,537,890% of 1003,537,890
3,537,890% of 1,00035,378,900
As a fraction of 1003,537,890/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,537,890
Nerdulate something else
Nothing in mind? Surprise me · today’s page