Recognised as Number
3,650,136
- Positive
- Even
- Composite
- 7 digits
3,650,136 is an even 7-digit integer and a composite number. It has 32 divisors and a digital root of 6.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value3,650,136
Digit count7
Digit sum24
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberYesdivisible by its own digit sum
Factors & divisors
Prime factorisation2^3 × 3 × 7 × 21,727
Distinct prime factors42, 3, 7, 21,727
Number of divisors32
Sum of divisors σ(n)10,429,440
Aliquot sum6,779,304sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)1,042,848integers below n that share no factor with it
Carmichael function λ(n)21,726the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,042,848
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 4, 6, 7, 8, 12, 14, 21, 24, 28, 42, 56, 84, 168, 21,727, 43,454, 65,181, 86,908, 130,362, 152,089, 173,816, 260,724, 304,178, 456,267, 521,448, 608,356, 912,534, 1,216,712, 1,825,068, 3,650,13632 in total
Arithmetic
Previous number3,650,135
Next number3,650,137
Double7,300,272
Half1,825,068
Square13,323,492,818,496
Cube48,632,560,782,533,715,456
Square root1,910.532909949≈irrational, shown to 9 decimal places
Cube root153.970084705≈
Negation-3,650,136
Reciprocal2.73962395 × 10^-7≈
Representations
Decimal3,650,136
Binary110111101100100101100022 bits
Octal15731130
Hexadecimal37B258
Base 36268GO
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, six hundred and fifty thousand, one hundred and thirty-six
Ordinalthree million, six hundred and fifty thousand, one hundred and thirty-sixth
Scientific notation3.650136 × 10^6
Engineering notation3.650136 × 10^6
In other bases
Ternary20212110001020base 3; the most digit-efficient integer base after e: 14 digits
Quinary1413301021base 5; one hand: 10 digits
Septenary43011540base 7: 8 digits
Nonary6773036base 9; each digit is two ternary digits: 7 digits
Duodecimal1280420base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal12g56gbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:53:55:36base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T10TT1100011T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010001111011110101000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101111011001001011000
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 even
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 33 trailing zeros
Power of twoNo
Bytes337 b2 58
Gray code1011000110101101110100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101111011001001011000
64-bit0000000000000000000000000000000000000000001101111011001001011000
One's complement11111111110010000100110110100111at 32 bits, every bit flipped
Bits reversed00011010010011011110110000000000at 32 bits
Rotated left by 100000000011011110110010010110000at 32 bits, wrapping
Shifted left by 111011110110010010110000= 7,300,272, no wrap
Shifted right by 1110111101100100101100= 1,825,068, discarding the low bit
These bits as a double1.8034068 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,650,136 to the power 213,323,492,818,496
3,650,136 to the power 348,632,560,782,533,715,456
3,650,136 to the power 4177,515,460,884,514,485,999,702,016
3,650,136 to the power 5647,955,574,331,158,167,869,008,317,874,176
First ten multiples3,650,136, 7,300,272, 10,950,408, 14,600,544, 18,250,680, 21,900,816, 25,550,952, 29,201,088, 32,851,224, 36,501,360
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4Yes
Divisible by 5No, remainder 1
Divisible by 6Yes
Divisible by 7Yes
Divisible by 8Yes
Divisible by 9No, remainder 6
Divisible by 10No, remainder 6
Divisible by 11No, remainder 6
Divisible by 12Yes
Divisible by 100No, remainder 36
Collatz (3n + 1) trajectory
Steps to reach 1172the total stopping time
Highest value reached3,650,136
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,650,136 → 1,825,068 → 912,534 → 456,267 → 1,368,802 → 684,401 → 2,053,204 → 1,026,602 → 513,301 → 1,539,904 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage365,013,600%
3,650,136% as a decimal36,501.36
3,650,136% of 1003,650,136
3,650,136% of 1,00036,501,360
As a fraction of 1003,650,136/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,650,136
Nerdulate something else
Nothing in mind? Surprise me · today’s page