Recognised as Number
1,613,841
- Positive
- Odd
- Composite
- 7 digits
1,613,841 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,613,841
Digit count7
Digit sum24
Digit product576
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 19 × 23 × 1,231
Distinct prime factors43, 19, 23, 1,231
Number of divisors16
Sum of divisors σ(n)2,365,440
Aliquot sum751,599sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)974,160integers below n that share no factor with it
Carmichael function λ(n)40,590the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 974,160
Möbius function μ(n)+14 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 19, 23, 57, 69, 437, 1,231, 1,311, 3,693, 23,389, 28,313, 70,167, 84,939, 537,947, 1,613,84116 in total
Arithmetic
Previous number1,613,840
Next number1,613,842
Double3,227,682
Half806,920.5
Square2,604,482,773,281
Cube4,203,221,083,314,582,321
Square root1,270.370418421≈irrational, shown to 9 decimal places
Cube root117.297002748≈
Negation-1,613,841
Reciprocal6.19639729 × 10^-7≈
Representations
Decimal1,613,841
Binary11000101000000001000121 bits
Octal6120021
Hexadecimal18A011
Base 36YL8X
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, six hundred and thirteen thousand, eight hundred and forty-one
Ordinalone million, six hundred and thirteen thousand, eight hundred and forty-first
Scientific notation1.613841 × 10^6
Engineering notation1.613841 × 10^6
In other bases
Ternary10000222202220base 3; the most digit-efficient integer base after e: 14 digits
Quinary403120331base 5; one hand: 9 digits
Septenary16501035base 7: 8 digits
Nonary3028686base 9; each digit is two ternary digits: 7 digits
Duodecimal659b29base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimala1ec1base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal7:28:17:21base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10001000T100T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010011110000000010001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000110001010000000010001
Bit length21 bitsto write the magnitude
Set bits6the population count, or Hamming weight
Zero bits15within that length
Bit parityeven6 set bits, so even; not the same as the number itself being odd
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes318 a0 11
Gray code101001111000000011001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000110001010000000010001
64-bit0000000000000000000000000000000000000000000110001010000000010001
One's complement11111111111001110101111111101110at 32 bits, every bit flipped
Bits reversed10001000000001010001100000000000at 32 bits
Rotated left by 100000000001100010100000000100010at 32 bits, wrapping
Shifted left by 11100010100000000100010= 3,227,682, no wrap
Shifted right by 111000101000000001000= 806,920, discarding the low bit
These bits as a double7.97343396 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,613,841 to the power 22,604,482,773,281
1,613,841 to the power 34,203,221,083,314,582,321
1,613,841 to the power 46,783,330,516,317,488,847,504,961
1,613,841 to the power 510,947,216,903,784,332,519,146,253,765,201
First ten multiples1,613,841, 3,227,682, 4,841,523, 6,455,364, 8,069,205, 9,683,046, 11,296,887, 12,910,728, 14,524,569, 16,138,410
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 5
Divisible by 8No, remainder 1
Divisible by 9No, remainder 6
Divisible by 10No, remainder 1
Divisible by 11No, remainder 9
Divisible by 12No, remainder 9
Divisible by 100No, remainder 41
Collatz (3n + 1) trajectory
Steps to reach 170the total stopping time
Highest value reached4,841,5243× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,613,841 → 4,841,524 → 2,420,762 → 1,210,381 → 3,631,144 → 1,815,572 → 907,786 → 453,893 → 1,361,680 → 680,840 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage161,384,100%
1,613,841% as a decimal16,138.41
1,613,841% of 1001,613,841
1,613,841% of 1,00016,138,410
As a fraction of 1001,613,841/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 1,613,841
Nerdulate something else
Nothing in mind? Surprise me · today’s page