Recognised as Number
3,644,635
- Positive
- Odd
- Composite
- 7 digits
3,644,635 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,644,635
Digit count7
Digit sum31
Digit product25,920
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation5 × 728,927
Distinct prime factors25, 728,927
Number of divisors4
Sum of divisors σ(n)4,373,568
Aliquot sum728,933sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,915,704integers below n that share no factor with it
Carmichael function λ(n)1,457,852the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,915,704
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 5, 728,927, 3,644,6354 in total
Arithmetic
Previous number3,644,634
Next number3,644,636
Double7,289,270
Half1,822,317.5
Square13,283,364,283,225
Cube48,413,014,384,391,747,875
Square root1,909.092716449≈irrational, shown to 9 decimal places
Cube root153.892698065≈
Negation-3,644,635
Reciprocal2.74375898 × 10^-7≈
Representations
Decimal3,644,635
Binary110111100111001101101122 bits
Octal15716333
Hexadecimal379CDB
Base 362647V
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, six hundred and forty-four thousand, six hundred and thirty-five
Ordinalthree million, six hundred and forty-four thousand, six hundred and thirty-fifth
Scientific notation3.644635 × 10^6
Engineering notation3.644635 × 10^6
In other bases
Ternary20212011111111base 3; the most digit-efficient integer base after e: 14 digits
Quinary1413112020base 5; one hand: 10 digits
Septenary42656521base 7: 8 digits
Nonary6764444base 9; each digit is two ternary digits: 7 digits
Duodecimal12791b7base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal12fbbfbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:52:23:55base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T10TT011111111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010001110110100101111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101111001110011011011
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
Bytes337 9c db
Gray code1011000101001010110110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101111001110011011011
64-bit0000000000000000000000000000000000000000001101111001110011011011
One's complement11111111110010000110001100100100at 32 bits, every bit flipped
Bits reversed11011011001110011110110000000000at 32 bits
Rotated left by 100000000011011110011100110110110at 32 bits, wrapping
Shifted left by 111011110011100110110110= 7,289,270, no wrap
Shifted right by 1110111100111001101101= 1,822,317, discarding the low bit
These bits as a double1.80068895 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,644,635 to the power 213,283,364,283,225
3,644,635 to the power 348,413,014,384,391,747,875
3,644,635 to the power 4176,447,766,680,857,618,016,400,625
3,644,635 to the power 5643,087,706,116,887,504,639,204,291,896,875
First ten multiples3,644,635, 7,289,270, 10,933,905, 14,578,540, 18,223,175, 21,867,810, 25,512,445, 29,157,080, 32,801,715, 36,446,350
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 5Yes
Divisible by 6No, remainder 1
Divisible by 7No, remainder 1
Divisible by 8No, remainder 3
Divisible by 9No, remainder 4
Divisible by 10No, remainder 5
Divisible by 11No, remainder 5
Divisible by 12No, remainder 7
Divisible by 100No, remainder 35
Collatz (3n + 1) trajectory
Steps to reach 1110the total stopping time
Highest value reached27,676,4567× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,644,635 → 10,933,906 → 5,466,953 → 16,400,860 → 8,200,430 → 4,100,215 → 12,300,646 → 6,150,323 → 18,450,970 → 9,225,485 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage364,463,500%
3,644,635% as a decimal36,446.35
3,644,635% of 1003,644,635
3,644,635% of 1,00036,446,350
As a fraction of 1003,644,635/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,644,635
Nerdulate something else
Nothing in mind? Surprise me · today’s page