Recognised as Number
3,639,613
- Positive
- Odd
- Composite
- 7 digits
3,639,613 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,639,613
Digit count7
Digit sum31
Digit product8,748
Multiplicative persistence5times 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 factorisation1,051 × 3,463
Distinct prime factors21,051, 3,463
Number of divisors4
Sum of divisors σ(n)3,644,128
Aliquot sum4,515sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,635,100integers below n that share no factor with it
Carmichael function λ(n)605,850the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,635,100
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 1,051, 3,463, 3,639,6134 in total
Arithmetic
Previous number3,639,612
Next number3,639,614
Double7,279,226
Half1,819,806.5
Square13,246,782,789,769
Cube48,213,162,849,819,519,397
Square root1,907.77697858≈irrational, shown to 9 decimal places
Cube root153.82198185≈
Negation-3,639,613
Reciprocal2.74754486 × 10^-7≈
Representations
Decimal3,639,613
Binary110111100010010011110122 bits
Octal15704475
Hexadecimal37893D
Base 36260CD
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, six hundred and thirty-nine thousand, six hundred and thirteen
Ordinalthree million, six hundred and thirty-nine thousand, six hundred and thirteenth
Scientific notation3.639613 × 10^6
Engineering notation3.639613 × 10^6
In other bases
Ternary20211220121111base 3; the most digit-efficient integer base after e: 14 digits
Quinary1412431423base 5; one hand: 10 digits
Septenary42636055base 7: 8 digits
Nonary6756544base 9; each digit is two ternary digits: 7 digits
Duodecimal1276311base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal12ej0dbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:51:0:13base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T10TT0T1TT1111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010001001100101001101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101111000100100111101
Bit length22 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits9within that length
Bit parityodd13 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 89 3d
Gray code1011000100110110100011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101111000100100111101
64-bit0000000000000000000000000000000000000000001101111000100100111101
One's complement11111111110010000111011011000010at 32 bits, every bit flipped
Bits reversed10111100100100011110110000000000at 32 bits
Rotated left by 100000000011011110001001001111010at 32 bits, wrapping
Shifted left by 111011110001001001111010= 7,279,226, no wrap
Shifted right by 1110111100010010011110= 1,819,806, discarding the low bit
These bits as a double1.79820775 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,639,613 to the power 213,246,782,789,769
3,639,613 to the power 348,213,162,849,819,519,397
3,639,613 to the power 4175,477,254,279,320,170,451,073,361
3,639,613 to the power 5638,669,295,879,319,323,535,942,468,649,293
First ten multiples3,639,613, 7,279,226, 10,918,839, 14,558,452, 18,198,065, 21,837,678, 25,477,291, 29,116,904, 32,756,517, 36,396,130
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 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 5
Divisible by 8No, remainder 5
Divisible by 9No, remainder 4
Divisible by 10No, remainder 3
Divisible by 11No, remainder 10
Divisible by 12No, remainder 1
Divisible by 100No, remainder 13
Collatz (3n + 1) trajectory
Steps to reach 1115the total stopping time
Highest value reached10,918,8403× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,639,613 → 10,918,840 → 5,459,420 → 2,729,710 → 1,364,855 → 4,094,566 → 2,047,283 → 6,141,850 → 3,070,925 → 9,212,776 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage363,961,300%
3,639,613% as a decimal36,396.13
3,639,613% of 1003,639,613
3,639,613% of 1,00036,396,130
As a fraction of 1003,639,613/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,639,613
Nerdulate something else
Nothing in mind? Surprise me · today’s page