Recognised as Number
3,636,398
- Positive
- Even
- Composite
- 7 digits
3,636,398 is an even 7-digit integer and a composite number. It has 4 divisors and a digital root of 2.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value3,636,398
Digit count7
Digit sum38
Digit product69,984
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 1,818,199
Distinct prime factors22, 1,818,199
Number of divisors4
Sum of divisors σ(n)5,454,600
Aliquot sum1,818,202sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,818,198integers below n that share no factor with it
Carmichael function λ(n)1,818,198the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 1,818,199, 3,636,3984 in total
Arithmetic
Previous number3,636,397
Next number3,636,399
Double7,272,796
Half1,818,199
Square13,223,390,414,404
Cube48,085,510,456,157,876,792
Square root1,906.934188691≈irrational, shown to 9 decimal places
Cube root153.776676359≈
Negation-3,636,398
Reciprocal2.74997401 × 10^-7≈
Representations
Decimal3,636,398
Binary110111011111001010111022 bits
Octal15676256
Hexadecimal377CAE
Base 3625XV2
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, six hundred and thirty-six thousand, three hundred and ninety-eight
Ordinalthree million, six hundred and thirty-six thousand, three hundred and ninety-eighth
Scientific notation3.636398 × 10^6
Engineering notation3.636398 × 10^6
In other bases
Ternary20211202012102base 3; the most digit-efficient integer base after e: 14 digits
Quinary1412331043base 5; one hand: 10 digits
Septenary42623513base 7: 8 digits
Nonary6752172base 9; each digit is two ternary digits: 7 digits
Duodecimal1274492base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal12eajibase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:50:6:38base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T10TTT1T1TT11Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010001000110111110010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101110111110010101110
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
Bytes337 7c ae
Gray code1011001100001011111001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101110111110010101110
64-bit0000000000000000000000000000000000000000001101110111110010101110
One's complement11111111110010001000001101010001at 32 bits, every bit flipped
Bits reversed01110101001111101110110000000000at 32 bits
Rotated left by 100000000011011101111100101011100at 32 bits, wrapping
Shifted left by 111011101111100101011100= 7,272,796, no wrap
Shifted right by 1110111011111001010111= 1,818,199, discarding the low bit
These bits as a double1.79661933 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,636,398 to the power 213,223,390,414,404
3,636,398 to the power 348,085,510,456,157,876,792
3,636,398 to the power 4174,858,054,051,751,590,850,675,216
3,636,398 to the power 5635,853,478,037,681,381,466,213,654,111,968
First ten multiples3,636,398, 7,272,796, 10,909,194, 14,545,592, 18,181,990, 21,818,388, 25,454,786, 29,091,184, 32,727,582, 36,363,980
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 5No, remainder 3
Divisible by 6No, remainder 2
Divisible by 7No, remainder 3
Divisible by 8No, remainder 6
Divisible by 9No, remainder 2
Divisible by 10No, remainder 8
Divisible by 11No, remainder 7
Divisible by 12No, remainder 2
Divisible by 100No, remainder 98
Collatz (3n + 1) trajectory
Steps to reach 1190the total stopping time
Highest value reached12,272,8483× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,636,398 → 1,818,199 → 5,454,598 → 2,727,299 → 8,181,898 → 4,090,949 → 12,272,848 → 6,136,424 → 3,068,212 → 1,534,106 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage363,639,800%
3,636,398% as a decimal36,363.98
3,636,398% of 1003,636,398
3,636,398% of 1,00036,363,980
As a fraction of 1003,636,398/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,636,398
Nerdulate something else
Nothing in mind? Surprise me · today’s page