Recognised as Number

1,371,545

Positive
Odd
Composite
7 digits

1,371,545 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 8.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value1,371,545

Digit count7

Digit sum26

Digit product2,100

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 factorisation5 × 7 × 149 × 263

Distinct prime factors45, 7, 149, 263

Number of divisors16

Sum of divisors σ(n)1,900,800

Aliquot sum529,255sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)58,164the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 930,624

Möbius function μ(n)+14 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 5, 7, 35, 149, 263, 745, 1,043, 1,315, 1,841, 5,215, 9,205, 39,187, 195,935, 274,309, 1,371,54516 in total

Arithmetic

Previous number1,371,544

Next number1,371,546

Double2,743,090

Half685,772.5

Square1,881,135,687,025

Cube2,580,062,245,860,703,625

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

Cube root111.105788819≈

Negation-1,371,545

Reciprocal7.29104769 × 10^-7≈

Representations

Decimal1,371,545

Binary10100111011011001100121 bits

Octal5166631

Hexadecimal14ED99

Base 36TEAH

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

In wordsone million, three hundred and seventy-one thousand, five hundred and forty-five

Ordinalone million, three hundred and seventy-one thousand, five hundred and forty-fifth

Scientific notation1.371545 × 10^6

Engineering notation1.371545 × 10^6

In other bases

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

Quinary322342140base 5; one hand: 9 digits

Septenary14441450base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000000101001110110110011001

Bit length21 bitsto write the magnitude

Set bits12the population count, or Hamming weight

Zero bits9within that length

Bit parityeven12 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 ed 99

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

At each machine width

32-bit00000000000101001110110110011001

64-bit0000000000000000000000000000000000000000000101001110110110011001

One's complement11111111111010110001001001100110at 32 bits, every bit flipped

Bits reversed10011001101101110010100000000000at 32 bits

Rotated left by 100000000001010011101101100110010at 32 bits, wrapping

Shifted left by 11010011101101100110010= 2,743,090, no wrap

Shifted right by 110100111011011001100= 685,772, discarding the low bit

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

Nearest landmarks

Next prime1,371,551+6

Previous prime1,371,541−4

Distance to nearest prime4

Nearest square below1,371,241

Nearest square above1,373,584

Powers & multiples

1,371,545 to the power 21,881,135,687,025

1,371,545 to the power 32,580,062,245,860,703,625

1,371,545 to the power 43,538,671,472,999,018,753,350,625

1,371,545 to the power 54,853,447,165,434,439,176,064,282,965,625

First ten multiples1,371,545, 2,743,090, 4,114,635, 5,486,180, 6,857,725, 8,229,270, 9,600,815, 10,972,360, 12,343,905, 13,715,450

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 5Yes

Divisible by 6No, remainder 5

Divisible by 7Yes

Divisible by 8No, remainder 1

Divisible by 9No, remainder 8

Divisible by 10No, remainder 5

Divisible by 11No, remainder 10

Divisible by 12No, remainder 5

Divisible by 100No, remainder 45

Collatz (3n + 1) trajectory

Steps to reach 1106the total stopping time

Highest value reached4,628,9683× the starting value

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

First steps1,371,545 → 4,114,636 → 2,057,318 → 1,028,659 → 3,085,978 → 1,542,989 → 4,628,968 → 2,314,484 → 1,157,242 → 578,621 → …

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

As a percentage & fraction

As a percentage137,154,500%

1,371,545% as a decimal13,715.45

1,371,545% of 1001,371,545

1,371,545% of 1,00013,715,450

As a fraction of 1001,371,545/100

Read another way

As seconds15 days, 20 hours and 59 minutes

As bytes1.308 MiB

As a 24-bit colour#14ED99

Keep nerding

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