Recognised as Number
1,401,671
- Positive
- Odd
- Composite
- 7 digits
1,401,671 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,401,671
Digit count7
Digit sum20
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation37 × 43 × 881
Distinct prime factors337, 43, 881
Number of divisors8
Sum of divisors σ(n)1,474,704
Aliquot sum73,033sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,330,560integers below n that share no factor with it
Carmichael function λ(n)55,440the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,330,560
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 37, 43, 881, 1,591, 32,597, 37,883, 1,401,6718 in total
Arithmetic
Previous number1,401,670
Next number1,401,672
Double2,803,342
Half700,835.5
Square1,964,681,592,241
Cube2,753,837,212,078,034,711
Square root1,183.921872422≈irrational, shown to 9 decimal places
Cube root111.913384351≈
Negation-1,401,671
Reciprocal7.1343418 × 10^-7≈
Representations
Decimal1,401,671
Binary10101011000110100011121 bits
Octal5261507
Hexadecimal156347
Base 36U1JB
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, four hundred and one thousand, six hundred and seventy-one
Ordinalone million, four hundred and one thousand, six hundred and seventy-first
Scientific notation1.401671 × 10^6
Engineering notation1.401671 × 10^6
In other bases
Ternary2122012201202base 3; the most digit-efficient integer base after e: 13 digits
Quinary324323141base 5; one hand: 9 digits
Septenary14625335base 7: 8 digits
Nonary2565652base 9; each digit is two ternary digits: 7 digits
Duodecimal57719bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal8f43bbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:29:21:11base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10T0T1T0T1TT1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010101010011101011011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101010110001101000111
Bit length21 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits10within that length
Bit parityodd11 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 63 47
Gray code111111101001011100100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101010110001101000111
64-bit0000000000000000000000000000000000000000000101010110001101000111
One's complement11111111111010101001110010111000at 32 bits, every bit flipped
Bits reversed11100010110001101010100000000000at 32 bits
Rotated left by 100000000001010101100011010001110at 32 bits, wrapping
Shifted left by 11010101100011010001110= 2,803,342, no wrap
Shifted right by 110101011000110100011= 700,835, discarding the low bit
These bits as a double6.92517488 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,401,671 to the power 21,964,681,592,241
1,401,671 to the power 32,753,837,212,078,034,711
1,401,671 to the power 43,859,973,758,890,630,991,402,081
1,401,671 to the power 55,410,413,278,597,989,632,349,546,277,351
First ten multiples1,401,671, 2,803,342, 4,205,013, 5,606,684, 7,008,355, 8,410,026, 9,811,697, 11,213,368, 12,615,039, 14,016,710
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 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 5
Divisible by 8No, remainder 7
Divisible by 9No, remainder 2
Divisible by 10No, remainder 1
Divisible by 11No, remainder 7
Divisible by 12No, remainder 11
Divisible by 100No, remainder 71
Collatz (3n + 1) trajectory
Steps to reach 1199the total stopping time
Highest value reached155,539,924110× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,401,671 → 4,205,014 → 2,102,507 → 6,307,522 → 3,153,761 → 9,461,284 → 4,730,642 → 2,365,321 → 7,095,964 → 3,547,982 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage140,167,100%
1,401,671% as a decimal14,016.71
1,401,671% of 1001,401,671
1,401,671% of 1,00014,016,710
As a fraction of 1001,401,671/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,401,671
Nerdulate something else
Nothing in mind? Surprise me · today’s page