Recognised as Number
3,618,635
- Positive
- Odd
- Composite
- 7 digits
3,618,635 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,618,635
Digit count7
Digit sum32
Digit product12,960
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation5 × 723,727
Distinct prime factors25, 723,727
Number of divisors4
Sum of divisors σ(n)4,342,368
Aliquot sum723,733sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,894,904integers below n that share no factor with it
Carmichael function λ(n)1,447,452the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,894,904
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 5, 723,727, 3,618,6354 in total
Arithmetic
Previous number3,618,634
Next number3,618,636
Double7,237,270
Half1,809,317.5
Square13,094,519,263,225
Cube47,384,285,714,080,197,875
Square root1,902.271011186≈irrational, shown to 9 decimal places
Cube root153.5258792≈
Negation-3,618,635
Reciprocal2.76347297 × 10^-7≈
Representations
Decimal3,618,635
Binary110111001101110100101122 bits
Octal15633513
Hexadecimal37374B
Base 3625K5N
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, six hundred and eighteen thousand, six hundred and thirty-five
Ordinalthree million, six hundred and eighteen thousand, six hundred and thirty-fifth
Scientific notation3.618635 × 10^6
Engineering notation3.618635 × 10^6
In other bases
Ternary20210211211112base 3; the most digit-efficient integer base after e: 14 digits
Quinary1411244020base 5; one hand: 10 digits
Septenary42520646base 7: 8 digits
Nonary6724745base 9; each digit is two ternary digits: 7 digits
Duodecimal126614bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal12c6bfbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:45:10:35base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1T110TT0TTTTTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010110100101101011111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101110011011101001011
Bit length22 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits8within that length
Bit parityeven14 set bits, so even; 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 37 4b
Gray code1011001010110011101110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101110011011101001011
64-bit0000000000000000000000000000000000000000001101110011011101001011
One's complement11111111110010001100100010110100at 32 bits, every bit flipped
Bits reversed11010010111011001110110000000000at 32 bits
Rotated left by 100000000011011100110111010010110at 32 bits, wrapping
Shifted left by 111011100110111010010110= 7,237,270, no wrap
Shifted right by 1110111001101110100101= 1,809,317, discarding the low bit
These bits as a double1.78784324 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,618,635 to the power 213,094,519,263,225
3,618,635 to the power 347,384,285,714,080,197,875
3,618,635 to the power 4171,466,434,734,970,596,837,400,625
3,618,635 to the power 5620,474,442,057,180,325,686,707,210,646,875
First ten multiples3,618,635, 7,237,270, 10,855,905, 14,474,540, 18,093,175, 21,711,810, 25,330,445, 28,949,080, 32,567,715, 36,186,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 2
Divisible by 4No, remainder 3
Divisible by 5Yes
Divisible by 6No, remainder 5
Divisible by 7No, remainder 6
Divisible by 8No, remainder 3
Divisible by 9No, remainder 5
Divisible by 10No, remainder 5
Divisible by 11No, remainder 9
Divisible by 12No, remainder 11
Divisible by 100No, remainder 35
Collatz (3n + 1) trajectory
Steps to reach 166the total stopping time
Highest value reached16,283,8604× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,618,635 → 10,855,906 → 5,427,953 → 16,283,860 → 8,141,930 → 4,070,965 → 12,212,896 → 6,106,448 → 3,053,224 → 1,526,612 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage361,863,500%
3,618,635% as a decimal36,186.35
3,618,635% of 1003,618,635
3,618,635% of 1,00036,186,350
As a fraction of 1003,618,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,618,635
Nerdulate something else
Nothing in mind? Surprise me · today’s page