Recognised as Number

1,315,849

Positive
Odd
Prime
7 digits

1,315,849 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,315,849

Digit count7

Digit sum31

Digit product4,320

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 factorisation1,315,849

Distinct prime factors11,315,849

Number of divisors2

Sum of divisors σ(n)1,315,850

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)1,315,848the 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,315,8492 in total

Arithmetic

Previous number1,315,848

Next number1,315,850

Double2,631,698

Half657,924.5

Square1,731,458,590,801

Cube2,278,338,055,246,905,049

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

Cube root109.581023274≈

Negation-1,315,849

Reciprocal7.59965619 × 10^-7≈

Representations

Decimal1,315,849

Binary10100000101000000100121 bits

Octal5012011

Hexadecimal141409

Base 36S7BD

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

In wordsone million, three hundred and fifteen thousand, eight hundred and forty-nine

Ordinalone million, three hundred and fifteen thousand, eight hundred and forty-ninth

Scientific notation1.315849 × 10^6

Engineering notation1.315849 × 10^6

In other bases

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

Quinary314101344base 5; one hand: 9 digits

Septenary14120203base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000000101000001010000001001

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 14 09

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

At each machine width

32-bit00000000000101000001010000001001

64-bit0000000000000000000000000000000000000000000101000001010000001001

One's complement11111111111010111110101111110110at 32 bits, every bit flipped

Bits reversed10010000001010000010100000000000at 32 bits

Rotated left by 100000000001010000010100000010010at 32 bits, wrapping

Shifted left by 11010000010100000010010= 2,631,698, no wrap

Shifted right by 110100000101000000100= 657,924, discarding the low bit

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

Nearest landmarks

Next prime1,315,861+12

Previous prime1,315,837−12

Distance to nearest prime0, it is prime

Nearest square below1,315,609

Nearest square above1,317,904

Powers & multiples

1,315,849 to the power 21,731,458,590,801

1,315,849 to the power 32,278,338,055,246,905,049

1,315,849 to the power 42,997,948,851,658,584,761,821,601

1,315,849 to the power 53,944,847,998,506,097,100,258,191,854,249

First ten multiples1,315,849, 2,631,698, 3,947,547, 5,263,396, 6,579,245, 7,895,094, 9,210,943, 10,526,792, 11,842,641, 13,158,490

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 4

Divisible by 6No, remainder 1

Divisible by 7No, remainder 3

Divisible by 8No, remainder 1

Divisible by 9No, remainder 4

Divisible by 10No, remainder 9

Divisible by 11No, remainder 7

Divisible by 12No, remainder 1

Divisible by 100No, remainder 49

Collatz (3n + 1) trajectory

Steps to reach 1142the total stopping time

Highest value reached6,661,4925× the starting value

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

First steps1,315,849 → 3,947,548 → 1,973,774 → 986,887 → 2,960,662 → 1,480,331 → 4,440,994 → 2,220,497 → 6,661,492 → 3,330,746 → …

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

As a percentage & fraction

As a percentage131,584,900%

1,315,849% as a decimal13,158.49

1,315,849% of 1001,315,849

1,315,849% of 1,00013,158,490

As a fraction of 1001,315,849/100

Read another way

As seconds15 days, 5 hours and 30 minutes

As bytes1.255 MiB

As a 24-bit colour#141409

Keep nerding

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