Recognised as Number
3,613,801
- Positive
- Odd
- Composite
- Perfect square
- 7 digits
3,613,801 is an odd 7-digit integer and a composite number. It has 3 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value3,613,801
Digit count7
Digit sum22
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Perfect squareYes, 1,901²
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation1,901^2
Distinct prime factors11,901
Number of divisors3
Sum of divisors σ(n)3,615,703
Aliquot sum1,902sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)3,611,900integers below n that share no factor with it
Carmichael function λ(n)3,611,900the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 1,901, 3,613,8013 in total
Arithmetic
Previous number3,613,800
Next number3,613,802
Double7,227,602
Half1,806,900.5
Square13,059,557,667,601
Cube47,194,642,558,734,161,401
Square root1,901exact
Cube root153.457485565≈
Negation-3,613,801
Reciprocal2.76716953 × 10^-7≈
Representations
Decimal3,613,801
Binary110111001001000110100122 bits
Octal15622151
Hexadecimal372469
Base 3625GFD
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, six hundred and thirteen thousand, eight hundred and one
Ordinalthree million, six hundred and thirteen thousand, eight hundred and first
Scientific notation3.613801 × 10^6
Engineering notation3.613801 × 10^6
In other bases
Ternary20210121012111base 3; the most digit-efficient integer base after e: 14 digits
Quinary1411120201base 5; one hand: 10 digits
Septenary42500602base 7: 8 digits
Nonary6717174base 9; each digit is two ternary digits: 7 digits
Duodecimal12633a1base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal12bea1base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal16:43:50:1base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T1T11TT11TT111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10010110110010110111001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001101110010010001101001
Bit length22 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits11within that length
Bit parityodd11 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 24 69
Gray code1011001011011001011101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001101110010010001101001
64-bit0000000000000000000000000000000000000000001101110010010001101001
One's complement11111111110010001101101110010110at 32 bits, every bit flipped
Bits reversed10010110001001001110110000000000at 32 bits
Rotated left by 100000000011011100100100011010010at 32 bits, wrapping
Shifted left by 111011100100100011010010= 7,227,602, no wrap
Shifted right by 1110111001001000110100= 1,806,900, discarding the low bit
These bits as a double1.78545493 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,613,801 to the power 213,059,557,667,601
3,613,801 to the power 347,194,642,558,734,161,401
3,613,801 to the power 4170,552,046,473,396,071,205,095,201
3,613,801 to the power 5616,341,156,097,605,195,517,044,242,469,001
First ten multiples3,613,801, 7,227,602, 10,841,403, 14,455,204, 18,069,005, 21,682,806, 25,296,607, 28,910,408, 32,524,209, 36,138,010
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 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 2
Divisible by 8No, remainder 1
Divisible by 9No, remainder 4
Divisible by 10No, remainder 1
Divisible by 11No, remainder 4
Divisible by 12No, remainder 1
Divisible by 100No, remainder 1
Collatz (3n + 1) trajectory
Steps to reach 1234the total stopping time
Highest value reached27,442,3127× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,613,801 → 10,841,404 → 5,420,702 → 2,710,351 → 8,131,054 → 4,065,527 → 12,196,582 → 6,098,291 → 18,294,874 → 9,147,437 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage361,380,100%
3,613,801% as a decimal36,138.01
3,613,801% of 1003,613,801
3,613,801% of 1,00036,138,010
As a fraction of 1003,613,801/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,613,801
Nerdulate something else
Nothing in mind? Surprise me · today’s page