Recognised as Number
1,371,056
- Positive
- Even
- Composite
- 7 digits
1,371,056 is an even 7-digit integer and a composite number. It has 10 divisors and a digital root of 5.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,371,056
Digit count7
Digit sum23
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^4 × 85,691
Distinct prime factors22, 85,691
Number of divisors10
Sum of divisors σ(n)2,656,452
Aliquot sum1,285,396sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)685,520integers below n that share no factor with it
Carmichael function λ(n)171,380the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 685,520
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 16, 85,691, 171,382, 342,764, 685,528, 1,371,05610 in total
Arithmetic
Previous number1,371,055
Next number1,371,057
Double2,742,112
Half685,528
Square1,879,794,555,136
Cube2,577,303,603,586,543,616
Square root1,170.921005021≈irrational, shown to 9 decimal places
Cube root111.092582985≈
Negation-1,371,056
Reciprocal7.29364811 × 10^-7≈
Representations
Decimal1,371,056
Binary10100111010111011000021 bits
Octal5165660
Hexadecimal14EBB0
Base 36TDWW
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and seventy-one thousand and fifty-six
Ordinalone million, three hundred and seventy-one thousand and fifty-sixth
Scientific notation1.371056 × 10^6
Engineering notation1.371056 × 10^6
In other bases
Ternary2120122201212base 3; the most digit-efficient integer base after e: 13 digits
Quinary322333211base 5; one hand: 9 digits
Septenary14440151base 7: 8 digits
Nonary2518655base 9; each digit is two ternary digits: 7 digits
Duodecimal561528base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal8b7cgbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:20:50:56base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10TT1T00T1T0TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101010011110011110000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101001110101110110000
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 even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 44 trailing zeros
Power of twoNo
Bytes314 eb b0
Gray code111101001111001101000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101001110101110110000
64-bit0000000000000000000000000000000000000000000101001110101110110000
One's complement11111111111010110001010001001111at 32 bits, every bit flipped
Bits reversed00001101110101110010100000000000at 32 bits
Rotated left by 100000000001010011101011101100000at 32 bits, wrapping
Shifted left by 11010011101011101100000= 2,742,112, no wrap
Shifted right by 110100111010111011000= 685,528, discarding the low bit
These bits as a double6.77391668 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,371,056 to the power 21,879,794,555,136
1,371,056 to the power 32,577,303,603,586,543,616
1,371,056 to the power 43,533,627,569,518,952,143,978,496
1,371,056 to the power 54,844,801,280,954,376,450,714,580,811,776
First ten multiples1,371,056, 2,742,112, 4,113,168, 5,484,224, 6,855,280, 8,226,336, 9,597,392, 10,968,448, 12,339,504, 13,710,560
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4Yes
Divisible by 5No, remainder 1
Divisible by 6No, remainder 2
Divisible by 7No, remainder 1
Divisible by 8Yes
Divisible by 9No, remainder 5
Divisible by 10No, remainder 6
Divisible by 11No, remainder 5
Divisible by 12No, remainder 8
Divisible by 100No, remainder 56
Collatz (3n + 1) trajectory
Steps to reach 1199the total stopping time
Highest value reached1,371,056
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,371,056 → 685,528 → 342,764 → 171,382 → 85,691 → 257,074 → 128,537 → 385,612 → 192,806 → 96,403 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage137,105,600%
1,371,056% as a decimal13,710.56
1,371,056% of 1001,371,056
1,371,056% of 1,00013,710,560
As a fraction of 1001,371,056/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,371,056
Nerdulate something else
Nothing in mind? Surprise me · today’s page