Recognised as Number
1,357,978
- Positive
- Even
- Composite
- 7 digits
1,357,978 is an even 7-digit integer and a composite number. It has 4 divisors and a digital root of 4.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,357,978
Digit count7
Digit sum40
Digit product52,920
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 678,989
Distinct prime factors22, 678,989
Number of divisors4
Sum of divisors σ(n)2,036,970
Aliquot sum678,992sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)678,988integers below n that share no factor with it
Carmichael function λ(n)678,988the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 678,989, 1,357,9784 in total
Arithmetic
Previous number1,357,977
Next number1,357,979
Double2,715,956
Half678,989
Square1,844,104,248,484
Cube2,504,252,999,147,805,352
Square root1,165.323131153≈irrational, shown to 9 decimal places
Cube root110.738230112≈
Negation-1,357,978
Reciprocal7.36388955 × 10^-7≈
Representations
Decimal1,357,978
Binary10100101110001001101021 bits
Octal5134232
Hexadecimal14B89A
Base 36T3TM
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and fifty-seven thousand, nine hundred and seventy-eight
Ordinalone million, three hundred and fifty-seven thousand, nine hundred and seventy-eighth
Scientific notation1.357978 × 10^6
Engineering notation1.357978 × 10^6
In other bases
Ternary2112222210111base 3; the most digit-efficient integer base after e: 13 digits
Quinary321423403base 5; one hand: 9 digits
Septenary14354056base 7: 8 digits
Nonary2488714base 9; each digit is two ternary digits: 7 digits
Duodecimal555a4abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal89eiibase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:17:12:58base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10TT0000T10111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101011100100111101110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101001011100010011010
Bit length21 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits11within that length
Bit parityeven10 set bits, so even; 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 b8 9a
Gray code111101110010011010111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101001011100010011010
64-bit0000000000000000000000000000000000000000000101001011100010011010
One's complement11111111111010110100011101100101at 32 bits, every bit flipped
Bits reversed01011001000111010010100000000000at 32 bits
Rotated left by 100000000001010010111000100110100at 32 bits, wrapping
Shifted left by 11010010111000100110100= 2,715,956, no wrap
Shifted right by 110100101110001001101= 678,989, discarding the low bit
These bits as a double6.70930278 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,357,978 to the power 21,844,104,248,484
1,357,978 to the power 32,504,252,999,147,805,352
1,357,978 to the power 43,400,720,479,276,738,416,298,256
1,357,978 to the power 54,618,103,595,007,266,681,087,873,086,368
First ten multiples1,357,978, 2,715,956, 4,073,934, 5,431,912, 6,789,890, 8,147,868, 9,505,846, 10,863,824, 12,221,802, 13,579,780
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4No, remainder 2
Divisible by 5No, remainder 3
Divisible by 6No, remainder 4
Divisible by 7No, remainder 6
Divisible by 8No, remainder 2
Divisible by 9No, remainder 4
Divisible by 10No, remainder 8
Divisible by 11No, remainder 6
Divisible by 12No, remainder 10
Divisible by 100No, remainder 78
Collatz (3n + 1) trajectory
Steps to reach 1111the total stopping time
Highest value reached2,036,9681× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,357,978 → 678,989 → 2,036,968 → 1,018,484 → 509,242 → 254,621 → 763,864 → 381,932 → 190,966 → 95,483 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage135,797,800%
1,357,978% as a decimal13,579.78
1,357,978% of 1001,357,978
1,357,978% of 1,00013,579,780
As a fraction of 1001,357,978/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,978
Nerdulate something else
Nothing in mind? Surprise me · today’s page