Recognised as Number
1,371,054
- Positive
- Even
- Composite
- 7 digits
1,371,054 is an even 7-digit integer and a composite number. It has 8 divisors and a digital root of 3.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,371,054
Digit count7
Digit sum21
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 3 × 228,509
Distinct prime factors32, 3, 228,509
Number of divisors8
Sum of divisors σ(n)2,742,120
Aliquot sum1,371,066sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)457,016integers below n that share no factor with it
Carmichael function λ(n)228,508the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 457,016
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 3, 6, 228,509, 457,018, 685,527, 1,371,0548 in total
Arithmetic
Previous number1,371,053
Next number1,371,055
Double2,742,108
Half685,527
Square1,879,789,070,916
Cube2,577,292,324,835,665,464
Square root1,170.920150992≈irrational, shown to 9 decimal places
Cube root111.092528967≈
Negation-1,371,054
Reciprocal7.29365875 × 10^-7≈
Representations
Decimal1,371,054
Binary10100111010111010111021 bits
Octal5165656
Hexadecimal14EBAE
Base 36TDWU
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and seventy-one thousand and fifty-four
Ordinalone million, three hundred and seventy-one thousand and fifty-fourth
Scientific notation1.371054 × 10^6
Engineering notation1.371054 × 10^6
In other bases
Ternary2120122201210base 3; the most digit-efficient integer base after e: 13 digits
Quinary322333204base 5; one hand: 9 digits
Septenary14440146base 7: 8 digits
Nonary2518653base 9; each digit is two ternary digits: 7 digits
Duodecimal561526base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal8b7cebase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:20:50:54base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10TT1T00T1TT10digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101010011110011110010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101001110101110101110
Bit length21 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits8within that length
Bit parityodd13 set bits, so odd; not the same as the number itself being even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes314 eb ae
Gray code111101001111001111001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101001110101110101110
64-bit0000000000000000000000000000000000000000000101001110101110101110
One's complement11111111111010110001010001010001at 32 bits, every bit flipped
Bits reversed01110101110101110010100000000000at 32 bits
Rotated left by 100000000001010011101011101011100at 32 bits, wrapping
Shifted left by 11010011101011101011100= 2,742,108, no wrap
Shifted right by 110100111010111010111= 685,527, discarding the low bit
These bits as a double6.7739068 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,371,054 to the power 21,879,789,070,916
1,371,054 to the power 32,577,292,324,835,665,464
1,371,054 to the power 43,533,606,951,135,238,477,079,056
1,371,054 to the power 54,844,765,944,781,773,254,953,148,045,024
First ten multiples1,371,054, 2,742,108, 4,113,162, 5,484,216, 6,855,270, 8,226,324, 9,597,378, 10,968,432, 12,339,486, 13,710,540
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4No, remainder 2
Divisible by 5No, remainder 4
Divisible by 6Yes
Divisible by 7No, remainder 6
Divisible by 8No, remainder 6
Divisible by 9No, remainder 3
Divisible by 10No, remainder 4
Divisible by 11No, remainder 3
Divisible by 12No, remainder 6
Divisible by 100No, remainder 54
Collatz (3n + 1) trajectory
Steps to reach 193the total stopping time
Highest value reached4,627,3123× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,371,054 → 685,527 → 2,056,582 → 1,028,291 → 3,084,874 → 1,542,437 → 4,627,312 → 2,313,656 → 1,156,828 → 578,414 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage137,105,400%
1,371,054% as a decimal13,710.54
1,371,054% of 1001,371,054
1,371,054% of 1,00013,710,540
As a fraction of 1001,371,054/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,054
Nerdulate something else
Nothing in mind? Surprise me · today’s page