Recognised as Number

1,310,409

Positive
Odd
Composite
7 digits

1,310,409 is an odd 7-digit integer and a composite number. It has 6 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value1,310,409

Digit count7

Digit sum18

Digit product0zero, because one of the digits is zero

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

Digital root9repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3^2 × 145,601

Distinct prime factors23, 145,601

Number of divisors6

Sum of divisors σ(n)1,892,826

Aliquot sum582,417sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)436,800the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 873,600

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 3, 9, 145,601, 436,803, 1,310,4096 in total

Arithmetic

Previous number1,310,408

Next number1,310,410

Double2,620,818

Half655,204.5

Square1,717,171,747,281

Cube2,250,197,312,182,747,929

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

Cube root109.429804263≈

Negation-1,310,409

Reciprocal7.63120522 × 10^-7≈

Representations

Decimal1,310,409

Binary10011111111101100100121 bits

Octal4777311

Hexadecimal13FEC9

Base 36S349

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

In wordsone million, three hundred and ten thousand, four hundred and nine

Ordinalone million, three hundred and ten thousand, four hundred and ninth

Scientific notation1.310409 × 10^6

Engineering notation1.310409 × 10^6

In other bases

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

Quinary313413114base 5; one hand: 9 digits

Septenary14065302base 7: 8 digits

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

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

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

Sexagesimal6:4:0:9base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000100111111111011001001

Bit length21 bitsto write the magnitude

Set bits14the population count, or Hamming weight

Zero bits7within that length

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

Bytes313 fe c9

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

At each machine width

32-bit00000000000100111111111011001001

64-bit0000000000000000000000000000000000000000000100111111111011001001

One's complement11111111111011000000000100110110at 32 bits, every bit flipped

Bits reversed10010011011111111100100000000000at 32 bits

Rotated left by 100000000001001111111110110010010at 32 bits, wrapping

Shifted left by 11001111111110110010010= 2,620,818, no wrap

Shifted right by 110011111111101100100= 655,204, discarding the low bit

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

Nearest landmarks

Next prime1,310,417+8

Previous prime1,310,399−10

Distance to nearest prime8

Nearest square below1,308,736

Nearest square above1,311,025

Powers & multiples

1,310,409 to the power 21,717,171,747,281

1,310,409 to the power 32,250,197,312,182,747,929

1,310,409 to the power 42,948,678,809,660,082,530,892,961

1,310,409 to the power 53,863,975,250,287,859,089,224,914,131,049

First ten multiples1,310,409, 2,620,818, 3,931,227, 5,241,636, 6,552,045, 7,862,454, 9,172,863, 10,483,272, 11,793,681, 13,104,090

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 4

Divisible by 6No, remainder 3

Divisible by 7No, remainder 2

Divisible by 8No, remainder 1

Divisible by 9Yes

Divisible by 10No, remainder 9

Divisible by 11No, remainder 1

Divisible by 12No, remainder 9

Divisible by 100No, remainder 9

Collatz (3n + 1) trajectory

Steps to reach 1173the total stopping time

Highest value reached6,633,9525× the starting value

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

First steps1,310,409 → 3,931,228 → 1,965,614 → 982,807 → 2,948,422 → 1,474,211 → 4,422,634 → 2,211,317 → 6,633,952 → 3,316,976 → …

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

As a percentage & fraction

As a percentage131,040,900%

1,310,409% as a decimal13,104.09

1,310,409% of 1001,310,409

1,310,409% of 1,00013,104,090

As a fraction of 1001,310,409/100

Read another way

As seconds15 days, 4 hours and 9 seconds

As bytes1.25 MiB

As a 24-bit colour#13FEC9

Keep nerding

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