Recognised as Number

1,421,437

Positive
Odd
Prime
7 digits

1,421,437 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 4.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value1,421,437

Digit count7

Digit sum22

Digit product672

Multiplicative persistence4times 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 factorisation1,421,437

Distinct prime factors11,421,437

Number of divisors2

Sum of divisors σ(n)1,421,438

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)1,421,436integers below n that share no factor with it

Carmichael function λ(n)1,421,436the smallest exponent with aˣ ≡ 1 for every unit coprime to n

Möbius function μ(n)−11 distinct prime factor, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 1,421,4372 in total

Arithmetic

Previous number1,421,436

Next number1,421,438

Double2,842,874

Half710,718.5

Square2,020,483,144,969

Cube2,871,989,500,135,300,453

Square root1,192.240328122≈irrational, shown to 9 decimal places

Cube root112.436988582≈

Negation-1,421,437

Reciprocal7.03513416 × 10^-7≈

Representations

Decimal1,421,437

Binary10101101100000111110121 bits

Octal5330175

Hexadecimal15B07D

Base 36UGSD

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordsone million, four hundred and twenty-one thousand, four hundred and thirty-seven

Ordinalone million, four hundred and twenty-one thousand, four hundred and thirty-seventh

Scientific notation1.421437 × 10^6

Engineering notation1.421437 × 10^6

In other bases

Ternary2200012211211base 3; the most digit-efficient integer base after e: 13 digits

Quinary330441222base 5; one hand: 9 digits

Septenary15040063base 7: 8 digits

Nonary2605754base 9; each digit is two ternary digits: 7 digits

Duodecimal586711base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits

Vigesimal8hdbhbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits

Sexagesimal6:34:50:37base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

Balanced ternary10T001T00TTT11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary11010101111000110001101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000101011011000001111101

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

Bytes315 b0 7d

Gray code111110110100001000011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000101011011000001111101

64-bit0000000000000000000000000000000000000000000101011011000001111101

One's complement11111111111010100100111110000010at 32 bits, every bit flipped

Bits reversed10111110000011011010100000000000at 32 bits

Rotated left by 100000000001010110110000011111010at 32 bits, wrapping

Shifted left by 11010110110000011111010= 2,842,874, no wrap

Shifted right by 110101101100000111110= 710,718, discarding the low bit

These bits as a double7.02283189 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime1,421,449+12

Previous prime1,421,417−20

Distance to nearest prime0, it is prime

Nearest square below1,420,864

Nearest square above1,423,249

Powers & multiples

1,421,437 to the power 22,020,483,144,969

1,421,437 to the power 32,871,989,500,135,300,453

1,421,437 to the power 44,082,352,139,103,821,070,010,961

1,421,437 to the power 55,802,806,377,551,318,110,293,170,370,957

First ten multiples1,421,437, 2,842,874, 4,264,311, 5,685,748, 7,107,185, 8,528,622, 9,950,059, 11,371,496, 12,792,933, 14,214,370

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 1

Divisible by 5No, remainder 2

Divisible by 6No, remainder 1

Divisible by 7No, remainder 3

Divisible by 8No, remainder 5

Divisible by 9No, remainder 4

Divisible by 10No, remainder 7

Divisible by 11No, remainder 6

Divisible by 12No, remainder 1

Divisible by 100No, remainder 37

Collatz (3n + 1) trajectory

Steps to reach 1124the total stopping time

Highest value reached11,526,6768× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps1,421,437 → 4,264,312 → 2,132,156 → 1,066,078 → 533,039 → 1,599,118 → 799,559 → 2,398,678 → 1,199,339 → 3,598,018 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage142,143,700%

1,421,437% as a decimal14,214.37

1,421,437% of 1001,421,437

1,421,437% of 1,00014,214,370

As a fraction of 1001,421,437/100

Read another way

As seconds16 days, 10 hours and 50 minutes

As bytes1.356 MiB

As a 24-bit colour#15B07D

Keep nerding

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