Nerdulator> put something in

Recognised as Number

1,351,426

  • Positive
  • Even
  • Composite
  • 7 digits

1,351,426 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,351,426
Digit count7
Digit sum22
Digit product720
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 × 675,713
Distinct prime factors22, 675,713
Number of divisors4
Sum of divisors σ(n)2,027,142
Aliquot sum675,716sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)675,712integers below n that share no factor with it
Carmichael function λ(n)675,712the 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, 675,713, 1,351,4264 in total

Arithmetic

Previous number1,351,425
Next number1,351,427
Double2,702,852
Cube2,468,179,893,477,536,776
Square root1,162.508494593≈irrational, shown to 9 decimal places
Cube root110.559845554≈
Negation-1,351,426
Reciprocal7.39959125 × 10^-7≈

Representations

Decimal1,351,426
Binary10100100111110000001021 bits
Octal5117402
Hexadecimal149F02
Base 36SYRM
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, three hundred and fifty-one thousand, four hundred and twenty-six
Ordinalone million, three hundred and fifty-one thousand, four hundred and twenty-sixth
Scientific notation1.351426 × 10^6
Engineering notation1.351426 × 10^6

In other bases

Ternary2112122210211base 3; the most digit-efficient integer base after e: 13 digits
Quinary321221201base 5; one hand: 9 digits
Septenary14326006base 7: 8 digits
Nonary2478724base 9; each digit is two ternary digits: 7 digits
Duodecimal5520aabase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal88ib6base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal6:15:23:46base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary10TT0T00T11T11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101011110001100000110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000101001001111100000010
Bit length21 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits12within that length
Bit parityodd9 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 9f 02
Gray code111101101000010000011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000101001001111100000010
64-bit0000000000000000000000000000000000000000000101001001111100000010
One's complement11111111111010110110000011111101at 32 bits, every bit flipped
Bits reversed01000000111110010010100000000000at 32 bits
Rotated left by 100000000001010010011111000000100at 32 bits, wrapping
Shifted left by 11010010011111000000100= 2,702,852, no wrap
Shifted right by 110100100111110000001= 675,713, discarding the low bit
These bits as a double6.67693159 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime1,351,439+13
Previous prime1,351,423−3
Distance to nearest prime3
Nearest square below1,350,244
Nearest square above1,352,569

Powers & multiples

1,351,426 to the power 21,826,352,233,476
1,351,426 to the power 32,468,179,893,477,536,776
1,351,426 to the power 43,335,562,480,722,773,615,042,576
1,351,426 to the power 54,507,765,861,073,255,055,482,528,313,376
First ten multiples1,351,426, 2,702,852, 4,054,278, 5,405,704, 6,757,130, 8,108,556, 9,459,982, 10,811,408, 12,162,834, 13,514,260
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 1
Divisible by 6No, remainder 4
Divisible by 7No, remainder 6
Divisible by 8No, remainder 2
Divisible by 9No, remainder 4
Divisible by 10No, remainder 6
Divisible by 11No, remainder 10
Divisible by 12No, remainder 10
Divisible by 100No, remainder 26

Collatz (3n + 1) trajectory

Steps to reach 1230the total stopping time
Highest value reached2,027,1401× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,351,426 → 675,713 → 2,027,140 → 1,013,570 → 506,785 → 1,520,356 → 760,178 → 380,089 → 1,140,268 → 570,134 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage135,142,600%
1,351,426% as a decimal13,514.26
1,351,426% of 1001,351,426
1,351,426% of 1,00013,514,260
As a fraction of 1001,351,426/100

Read another way

As bytes1.289 MiB
As a 24-bit colour#149F02

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “1351426” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.