Recognised as Number

1,314,957

Positive
Odd
Composite
7 digits

1,314,957 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 3.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value1,314,957

Digit count7

Digit sum30

Digit product3,780

Multiplicative persistence2times 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 factorisation3 × 7 × 62,617

Distinct prime factors33, 7, 62,617

Number of divisors8

Sum of divisors σ(n)2,003,776

Aliquot sum688,819sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)751,392integers below n that share no factor with it

Carmichael function λ(n)62,616the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 751,392

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

SquarefreeYesno repeated prime factor

All divisors1, 3, 7, 21, 62,617, 187,851, 438,319, 1,314,9578 in total

Arithmetic

Previous number1,314,956

Next number1,314,958

Double2,629,914

Half657,478.5

Square1,729,111,911,849

Cube2,273,707,812,269,225,493

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

Cube root109.556256408≈

Negation-1,314,957

Reciprocal7.60481141 × 10^-7≈

Representations

Decimal1,314,957

Binary10100000100001000110121 bits

Octal5010215

Hexadecimal14108D

Base 36S6ML

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

In wordsone million, three hundred and fourteen thousand, nine hundred and fifty-seven

Ordinalone million, three hundred and fourteen thousand, nine hundred and fifty-seventh

Scientific notation1.314957 × 10^6

Engineering notation1.314957 × 10^6

In other bases

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

Quinary314034312base 5; one hand: 9 digits

Septenary14114460base 7: 8 digits

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

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

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

Sexagesimal6:5:15:57base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000101000001000010001101

Bit length21 bitsto write the magnitude

Set bits7the population count, or Hamming weight

Zero bits14within that length

Bit parityodd7 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 10 8d

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

At each machine width

32-bit00000000000101000001000010001101

64-bit0000000000000000000000000000000000000000000101000001000010001101

One's complement11111111111010111110111101110010at 32 bits, every bit flipped

Bits reversed10110001000010000010100000000000at 32 bits

Rotated left by 100000000001010000010000100011010at 32 bits, wrapping

Shifted left by 11010000010000100011010= 2,629,914, no wrap

Shifted right by 110100000100001000110= 657,478, discarding the low bit

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

Nearest landmarks

Next prime1,314,997+40

Previous prime1,314,953−4

Distance to nearest prime4

Nearest square below1,313,316

Nearest square above1,315,609

Powers & multiples

1,314,957 to the power 21,729,111,911,849

1,314,957 to the power 32,273,707,812,269,225,493

1,314,957 to the power 42,989,828,003,698,103,946,598,801

1,314,957 to the power 53,931,495,262,258,847,671,307,719,566,557

First ten multiples1,314,957, 2,629,914, 3,944,871, 5,259,828, 6,574,785, 7,889,742, 9,204,699, 10,519,656, 11,834,613, 13,149,570

Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 1

Divisible by 5No, remainder 2

Divisible by 6No, remainder 3

Divisible by 7Yes

Divisible by 8No, remainder 5

Divisible by 9No, remainder 3

Divisible by 10No, remainder 7

Divisible by 11No, remainder 6

Divisible by 12No, remainder 9

Divisible by 100No, remainder 57

Collatz (3n + 1) trajectory

Steps to reach 1155the total stopping time

Highest value reached3,944,8723× the starting value

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

First steps1,314,957 → 3,944,872 → 1,972,436 → 986,218 → 493,109 → 1,479,328 → 739,664 → 369,832 → 184,916 → 92,458 → …

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

As a percentage & fraction

As a percentage131,495,700%

1,314,957% as a decimal13,149.57

1,314,957% of 1001,314,957

1,314,957% of 1,00013,149,570

As a fraction of 1001,314,957/100

Read another way

As seconds15 days, 5 hours and 15 minutes

As bytes1.254 MiB

As a 24-bit colour#14108D

Keep nerding

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