Recognised as Number

1,144,573

Positive
Odd
Prime
7 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value1,144,573

Digit count7

Digit sum25

Digit product1,680

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

Digital root7repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation1,144,573

Distinct prime factors11,144,573

Number of divisors2

Sum of divisors σ(n)1,144,574

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)1,144,572the 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,144,5732 in total

Arithmetic

Previous number1,144,572

Next number1,144,574

Double2,289,146

Half572,286.5

Square1,310,047,352,329

Cube1,499,444,828,197,260,517

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

Cube root104.603889266≈

Negation-1,144,573

Reciprocal8.73688266 × 10^-7≈

Representations

Decimal1,144,573

Binary10001011101101111110121 bits

Octal4273375

Hexadecimal1176FD

Base 36OJ5P

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

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

Ordinalone million, one hundred and forty-four thousand, five hundred and seventy-third

Scientific notation1.144573 × 10^6

Engineering notation1.144573 × 10^6

In other bases

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

Quinary243111243base 5; one hand: 9 digits

Septenary12504643base 7: 8 digits

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

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

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

Sexagesimal5:17:56:13base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000100010111011011111101

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

Bytes311 76 fd

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

At each machine width

32-bit00000000000100010111011011111101

64-bit0000000000000000000000000000000000000000000100010111011011111101

One's complement11111111111011101000100100000010at 32 bits, every bit flipped

Bits reversed10111111011011101000100000000000at 32 bits

Rotated left by 100000000001000101110110111111010at 32 bits, wrapping

Shifted left by 11000101110110111111010= 2,289,146, no wrap

Shifted right by 110001011101101111110= 572,286, discarding the low bit

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

Nearest landmarks

Next prime1,144,589+16

Previous prime1,144,537−36

Distance to nearest prime0, it is prime

Nearest square below1,142,761

Nearest square above1,144,900

Powers & multiples

1,144,573 to the power 21,310,047,352,329

1,144,573 to the power 31,499,444,828,197,260,517

1,144,573 to the power 41,716,224,065,344,223,061,724,241

1,144,573 to the power 51,964,343,727,143,233,422,426,899,694,093

First ten multiples1,144,573, 2,289,146, 3,433,719, 4,578,292, 5,722,865, 6,867,438, 8,012,011, 9,156,584, 10,301,157, 11,445,730

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 3

Divisible by 6No, remainder 1

Divisible by 7No, remainder 3

Divisible by 8No, remainder 5

Divisible by 9No, remainder 7

Divisible by 10No, remainder 3

Divisible by 11No, remainder 1

Divisible by 12No, remainder 1

Divisible by 100No, remainder 73

Collatz (3n + 1) trajectory

Steps to reach 1129the total stopping time

Highest value reached27,844,61224× the starting value

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

First steps1,144,573 → 3,433,720 → 1,716,860 → 858,430 → 429,215 → 1,287,646 → 643,823 → 1,931,470 → 965,735 → 2,897,206 → …

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

As a percentage & fraction

As a percentage114,457,300%

1,144,573% as a decimal11,445.73

1,144,573% of 1001,144,573

1,144,573% of 1,00011,445,730

As a fraction of 1001,144,573/100

Read another way

As seconds13 days, 5 hours and 56 minutes

As bytes1.092 MiB

As a 24-bit colour#1176FD

Keep nerding

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