Recognised as Number
1,357,171
- Positive
- Odd
- Composite
- 7 digits
1,357,171 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,357,171
Digit count7
Digit sum25
Digit product735
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation29 × 53 × 883
Distinct prime factors329, 53, 883
Number of divisors8
Sum of divisors σ(n)1,432,080
Aliquot sum74,909sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,284,192integers below n that share no factor with it
Carmichael function λ(n)22,932the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,284,192
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 29, 53, 883, 1,537, 25,607, 46,799, 1,357,1718 in total
Arithmetic
Previous number1,357,170
Next number1,357,172
Double2,714,342
Half678,585.5
Square1,841,913,123,241
Cube2,499,791,075,382,111,211
Square root1,164.976823804≈irrational, shown to 9 decimal places
Cube root110.716289781≈
Negation-1,357,171
Reciprocal7.36826826 × 10^-7≈
Representations
Decimal1,357,171
Binary10100101101010111001121 bits
Octal5132563
Hexadecimal14B573
Base 36T377
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and fifty-seven thousand, one hundred and seventy-one
Ordinalone million, three hundred and fifty-seven thousand, one hundred and seventy-first
Scientific notation1.357171 × 10^6
Engineering notation1.357171 × 10^6
In other bases
Ternary2112221200121base 3; the most digit-efficient integer base after e: 13 digits
Quinary321412141base 5; one hand: 9 digits
Septenary14351524base 7: 8 digits
Nonary2487617base 9; each digit is two ternary digits: 7 digits
Duodecimal555497base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal89cibbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:16:59:31base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10TT000TT01TT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101011100101010110111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101001011010101110011
Bit length21 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits9within that length
Bit parityeven12 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
Bytes314 b5 73
Gray code111101110111111001010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101001011010101110011
64-bit0000000000000000000000000000000000000000000101001011010101110011
One's complement11111111111010110100101010001100at 32 bits, every bit flipped
Bits reversed11001110101011010010100000000000at 32 bits
Rotated left by 100000000001010010110101011100110at 32 bits, wrapping
Shifted left by 11010010110101011100110= 2,714,342, no wrap
Shifted right by 110100101101010111001= 678,585, discarding the low bit
These bits as a double6.70531567 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,357,171 to the power 21,841,913,123,241
1,357,171 to the power 32,499,791,075,382,111,211
1,357,171 to the power 43,392,643,953,567,415,254,344,081
1,357,171 to the power 54,604,397,987,107,042,528,153,410,754,851
First ten multiples1,357,171, 2,714,342, 4,071,513, 5,428,684, 6,785,855, 8,143,026, 9,500,197, 10,857,368, 12,214,539, 13,571,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 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 4
Divisible by 8No, remainder 3
Divisible by 9No, remainder 7
Divisible by 10No, remainder 1
Divisible by 11No, remainder 2
Divisible by 12No, remainder 7
Divisible by 100No, remainder 71
Collatz (3n + 1) trajectory
Steps to reach 1137the total stopping time
Highest value reached6,107,2724× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,357,171 → 4,071,514 → 2,035,757 → 6,107,272 → 3,053,636 → 1,526,818 → 763,409 → 2,290,228 → 1,145,114 → 572,557 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage135,717,100%
1,357,171% as a decimal13,571.71
1,357,171% of 1001,357,171
1,357,171% of 1,00013,571,710
As a fraction of 1001,357,171/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,357,171
Nerdulate something else
Nothing in mind? Surprise me · today’s page