Recognised as Number

1,340,497

Positive
Odd
Prime
7 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value1,340,497

Digit count7

Digit sum28

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times the digit product can be taken before one digit is left

Digital root1repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation1,340,497

Distinct prime factors11,340,497

Number of divisors2

Sum of divisors σ(n)1,340,498

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)1,340,496the 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,340,4972 in total

Arithmetic

Previous number1,340,496

Next number1,340,498

Double2,680,994

Half670,248.5

Square1,796,932,207,009

Cube2,408,782,232,698,943,473

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

Cube root110.261005546≈

Negation-1,340,497

Reciprocal7.45991972 × 10^-7≈

Representations

Decimal1,340,497

Binary10100011101000101000121 bits

Octal5072121

Hexadecimal147451

Base 36SQC1

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

In wordsone million, three hundred and forty thousand, four hundred and ninety-seven

Ordinalone million, three hundred and forty thousand, four hundred and ninety-seventh

Scientific notation1.340497 × 10^6

Engineering notation1.340497 × 10^6

In other bases

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

Quinary320343442base 5; one hand: 9 digits

Septenary14252104base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000000101000111010001010001

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 odd

Highest set bitbit 20worth 1,048,576

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes314 74 51

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

At each machine width

32-bit00000000000101000111010001010001

64-bit0000000000000000000000000000000000000000000101000111010001010001

One's complement11111111111010111000101110101110at 32 bits, every bit flipped

Bits reversed10001010001011100010100000000000at 32 bits

Rotated left by 100000000001010001110100010100010at 32 bits, wrapping

Shifted left by 11010001110100010100010= 2,680,994, no wrap

Shifted right by 110100011101000101000= 670,248, discarding the low bit

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

Nearest landmarks

Next prime1,340,527+30

Previous prime1,340,491−6

Distance to nearest prime0, it is prime

Nearest square below1,338,649

Nearest square above1,340,964

Powers & multiples

1,340,497 to the power 21,796,932,207,009

1,340,497 to the power 32,408,782,232,698,943,473

1,340,497 to the power 43,228,965,356,586,235,628,726,081

1,340,497 to the power 54,328,418,373,607,779,101,600,425,402,257

First ten multiples1,340,497, 2,680,994, 4,021,491, 5,361,988, 6,702,485, 8,042,982, 9,383,479, 10,723,976, 12,064,473, 13,404,970

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 4

Divisible by 8No, remainder 1

Divisible by 9No, remainder 1

Divisible by 10No, remainder 7

Divisible by 11No, remainder 4

Divisible by 12No, remainder 1

Divisible by 100No, remainder 97

Collatz (3n + 1) trajectory

Steps to reach 1186the total stopping time

Highest value reached6,114,5804× the starting value

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

First steps1,340,497 → 4,021,492 → 2,010,746 → 1,005,373 → 3,016,120 → 1,508,060 → 754,030 → 377,015 → 1,131,046 → 565,523 → …

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

As a percentage & fraction

As a percentage134,049,700%

1,340,497% as a decimal13,404.97

1,340,497% of 1001,340,497

1,340,497% of 1,00013,404,970

As a fraction of 1001,340,497/100

Read another way

As seconds15 days, 12 hours and 21 minutes

As bytes1.278 MiB

As a 24-bit colour#147451

Keep nerding

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