Recognised as Number

1,314,953

Positive
Odd
Prime
7 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value1,314,953

Digit count7

Digit sum26

Digit product1,620

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

Digital root8repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation1,314,953

Distinct prime factors11,314,953

Number of divisors2

Sum of divisors σ(n)1,314,954

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)1,314,952the 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,314,9532 in total

Arithmetic

Previous number1,314,952

Next number1,314,954

Double2,629,906

Half657,476.5

Square1,729,101,392,209

Cube2,273,687,062,989,401,177

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

Cube root109.556145321≈

Negation-1,314,953

Reciprocal7.60483455 × 10^-7≈

Representations

Decimal1,314,953

Binary10100000100001000100121 bits

Octal5010211

Hexadecimal141089

Base 36S6MH

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

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

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

Scientific notation1.314953 × 10^6

Engineering notation1.314953 × 10^6

In other bases

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

Quinary314034303base 5; one hand: 9 digits

Septenary14114453base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000000101000001000010001001

Bit length21 bitsto write the magnitude

Set bits6the population count, or Hamming weight

Zero bits15within that length

Bit parityeven6 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

Bytes314 10 89

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

At each machine width

32-bit00000000000101000001000010001001

64-bit0000000000000000000000000000000000000000000101000001000010001001

One's complement11111111111010111110111101110110at 32 bits, every bit flipped

Bits reversed10010001000010000010100000000000at 32 bits

Rotated left by 100000000001010000010000100010010at 32 bits, wrapping

Shifted left by 11010000010000100010010= 2,629,906, no wrap

Shifted right by 110100000100001000100= 657,476, discarding the low bit

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

Nearest landmarks

Next prime1,314,997+44

Previous prime1,314,941−12

Distance to nearest prime0, it is prime

Nearest square below1,313,316

Nearest square above1,315,609

Powers & multiples

1,314,953 to the power 21,729,101,392,209

1,314,953 to the power 32,273,687,062,989,401,177

1,314,953 to the power 42,989,791,624,539,102,045,899,681

1,314,953 to the power 53,931,435,466,062,565,852,561,923,229,993

First ten multiples1,314,953, 2,629,906, 3,944,859, 5,259,812, 6,574,765, 7,889,718, 9,204,671, 10,519,624, 11,834,577, 13,149,530

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 2

Divisible by 4No, remainder 1

Divisible by 5No, remainder 3

Divisible by 6No, remainder 5

Divisible by 7No, remainder 3

Divisible by 8No, remainder 1

Divisible by 9No, remainder 8

Divisible by 10No, remainder 3

Divisible by 11No, remainder 2

Divisible by 12No, remainder 5

Divisible by 100No, remainder 53

Collatz (3n + 1) trajectory

Steps to reach 1217the total stopping time

Highest value reached143,952,712109× the starting value

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

First steps1,314,953 → 3,944,860 → 1,972,430 → 986,215 → 2,958,646 → 1,479,323 → 4,437,970 → 2,218,985 → 6,656,956 → 3,328,478 → …

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

As a percentage & fraction

As a percentage131,495,300%

1,314,953% as a decimal13,149.53

1,314,953% of 1001,314,953

1,314,953% of 1,00013,149,530

As a fraction of 1001,314,953/100

Read another way

As seconds15 days, 5 hours and 15 minutes

As bytes1.254 MiB

As a 24-bit colour#141089

Keep nerding

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