Recognised as Number
1,404,161
- Positive
- Odd
- Composite
- 7 digits
1,404,161 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,404,161
Digit count7
Digit sum17
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation11 × 107 × 1,193
Distinct prime factors311, 107, 1,193
Number of divisors8
Sum of divisors σ(n)1,547,424
Aliquot sum143,263sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,263,520integers below n that share no factor with it
Carmichael function λ(n)315,880the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,263,520
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 11, 107, 1,177, 1,193, 13,123, 127,651, 1,404,1618 in total
Arithmetic
Previous number1,404,160
Next number1,404,162
Double2,808,322
Half702,080.5
Square1,971,668,113,921
Cube2,768,539,470,511,425,281
Square root1,184.972995473≈irrational, shown to 9 decimal places
Cube root111.9796147≈
Negation-1,404,161
Reciprocal7.12169046 × 10^-7≈
Representations
Decimal1,404,161
Binary10101011011010000000121 bits
Octal5266401
Hexadecimal156D01
Base 36U3GH
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, four hundred and four thousand, one hundred and sixty-one
Ordinalone million, four hundred and four thousand, one hundred and sixty-first
Scientific notation1.404161 × 10^6
Engineering notation1.404161 × 10^6
In other bases
Ternary2122100010222base 3; the most digit-efficient integer base after e: 13 digits
Quinary324413121base 5; one hand: 9 digits
Septenary14635523base 7: 8 digits
Nonary2570128base 9; each digit is two ternary digits: 7 digits
Duodecimal578715base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal8fa81base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:30:2:41base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T0T10001100Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010101011110100000001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101010110110100000001
Bit length21 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits12within that length
Bit parityodd9 set bits, so odd; 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
Bytes315 6d 01
Gray code111111101101110000001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101010110110100000001
64-bit0000000000000000000000000000000000000000000101010110110100000001
One's complement11111111111010101001001011111110at 32 bits, every bit flipped
Bits reversed10000000101101101010100000000000at 32 bits
Rotated left by 100000000001010101101101000000010at 32 bits, wrapping
Shifted left by 11010101101101000000010= 2,808,322, no wrap
Shifted right by 110101011011010000000= 702,080, discarding the low bit
These bits as a double6.93747711 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,404,161 to the power 21,971,668,113,921
1,404,161 to the power 32,768,539,470,511,425,281
1,404,161 to the power 43,887,475,151,452,793,433,994,241
1,404,161 to the power 55,458,640,996,139,105,881,070,787,436,801
First ten multiples1,404,161, 2,808,322, 4,212,483, 5,616,644, 7,020,805, 8,424,966, 9,829,127, 11,233,288, 12,637,449, 14,041,610
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 3
Divisible by 8No, remainder 1
Divisible by 9No, remainder 8
Divisible by 10No, remainder 1
Divisible by 11Yes
Divisible by 12No, remainder 5
Divisible by 100No, remainder 61
Collatz (3n + 1) trajectory
Steps to reach 1129the total stopping time
Highest value reached21,616,79215× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,404,161 → 4,212,484 → 2,106,242 → 1,053,121 → 3,159,364 → 1,579,682 → 789,841 → 2,369,524 → 1,184,762 → 592,381 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage140,416,100%
1,404,161% as a decimal14,041.61
1,404,161% of 1001,404,161
1,404,161% of 1,00014,041,610
As a fraction of 1001,404,161/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,404,161
Nerdulate something else
Nothing in mind? Surprise me · today’s page