Recognised as Number
3,604,231
- Positive
- Odd
- Composite
- 7 digits
3,604,231 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,604,231
Digit count7
Digit sum19
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation229 × 15,739
Distinct prime factors2229, 15,739
Number of divisors4
Sum of divisors σ(n)3,620,200
Aliquot sum15,969sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,588,264integers below n that share no factor with it
Carmichael function λ(n)598,044the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,588,264
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 229, 15,739, 3,604,2314 in total
Arithmetic
Previous number3,604,230
Next number3,604,232
Double7,208,462
Half1,802,115.5
Square12,990,481,101,361
Cube46,820,694,690,439,458,391
Square root1,898.481235093≈irrational, shown to 9 decimal places
Cube root153.321904735≈
Negation-3,604,231
Reciprocal2.77451695 × 10^-7≈
Representations
Decimal3,604,231
Binary110110111111110000011122 bits
Octal15577407
Hexadecimal36FF07
Base 362591J
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, six hundred and four thousand, two hundred and thirty-one
Ordinalthree million, six hundred and four thousand, two hundred and thirty-first
Scientific notation3.604231 × 10^6
Engineering notation3.604231 × 10^6
In other bases
Ternary20210010002001base 3; the most digit-efficient integer base after e: 14 digits
Quinary1410313411base 5; one hand: 10 digits
Septenary42430651base 7: 8 digits
Nonary6703061base 9; each digit is two ternary digits: 7 digits
Duodecimal1259947base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal12aabbbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:41:10:31base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1T1001001T001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010110000001100011011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101101111111100000111
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 odd
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes336 ff 07
Gray code1011011000000010000100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101101111111100000111
64-bit0000000000000000000000000000000000000000001101101111111100000111
One's complement11111111110010010000000011111000at 32 bits, every bit flipped
Bits reversed11100000111111110110110000000000at 32 bits
Rotated left by 100000000011011011111111000001110at 32 bits, wrapping
Shifted left by 111011011111111000001110= 7,208,462, no wrap
Shifted right by 1110110111111110000011= 1,802,115, discarding the low bit
These bits as a double1.78072672 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,604,231 to the power 212,990,481,101,361
3,604,231 to the power 346,820,694,690,439,458,391
3,604,231 to the power 4168,752,599,244,817,299,556,052,321
3,604,231 to the power 5608,223,349,528,747,100,396,210,012,970,151
First ten multiples3,604,231, 7,208,462, 10,812,693, 14,416,924, 18,021,155, 21,625,386, 25,229,617, 28,833,848, 32,438,079, 36,042,310
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 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 1
Divisible by 8No, remainder 7
Divisible by 9No, remainder 1
Divisible by 10No, remainder 1
Divisible by 11No, remainder 4
Divisible by 12No, remainder 7
Divisible by 100No, remainder 31
Collatz (3n + 1) trajectory
Steps to reach 1115the total stopping time
Highest value reached24,328,5646× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,604,231 → 10,812,694 → 5,406,347 → 16,219,042 → 8,109,521 → 24,328,564 → 12,164,282 → 6,082,141 → 18,246,424 → 9,123,212 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage360,423,100%
3,604,231% as a decimal36,042.31
3,604,231% of 1003,604,231
3,604,231% of 1,00036,042,310
As a fraction of 1003,604,231/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,604,231
Nerdulate something else
Nothing in mind? Surprise me · today’s page