Recognised as Number

1,446,281

Positive
Odd
Prime
7 digits

1,446,281 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,446,281

Digit count7

Digit sum26

Digit product1,536

Multiplicative persistence3times 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,446,281

Distinct prime factors11,446,281

Number of divisors2

Sum of divisors σ(n)1,446,282

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)1,446,280the 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,446,2812 in total

Arithmetic

Previous number1,446,280

Next number1,446,282

Double2,892,562

Half723,140.5

Square2,091,728,730,961

Cube3,025,227,520,743,006,041

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

Cube root113.088269976≈

Negation-1,446,281

Reciprocal6.91428567 × 10^-7≈

Representations

Decimal1,446,281

Binary10110000100011000100121 bits

Octal5410611

Hexadecimal161189

Base 36UZYH

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

In wordsone million, four hundred and forty-six thousand, two hundred and eighty-one

Ordinalone million, four hundred and forty-six thousand, two hundred and eighty-first

Scientific notation1.446281 × 10^6

Engineering notation1.446281 × 10^6

In other bases

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

Quinary332240111base 5; one hand: 9 digits

Septenary15202364base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000000101100001000110001001

Bit length21 bitsto write the magnitude

Set bits8the population count, or Hamming weight

Zero bits13within that length

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

Bytes316 11 89

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

At each machine width

32-bit00000000000101100001000110001001

64-bit0000000000000000000000000000000000000000000101100001000110001001

One's complement11111111111010011110111001110110at 32 bits, every bit flipped

Bits reversed10010001100010000110100000000000at 32 bits

Rotated left by 100000000001011000010001100010010at 32 bits, wrapping

Shifted left by 11011000010001100010010= 2,892,562, no wrap

Shifted right by 110110000100011000100= 723,140, discarding the low bit

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

Nearest landmarks

Next prime1,446,301+20

Previous prime1,446,257−24

Distance to nearest prime0, it is prime

Nearest square below1,444,804

Nearest square above1,447,209

Powers & multiples

1,446,281 to the power 22,091,728,730,961

1,446,281 to the power 33,025,227,520,743,006,041

1,446,281 to the power 44,375,329,083,927,715,519,983,521

1,446,281 to the power 56,327,955,322,832,060,329,957,286,735,401

First ten multiples1,446,281, 2,892,562, 4,338,843, 5,785,124, 7,231,405, 8,677,686, 10,123,967, 11,570,248, 13,016,529, 14,462,810

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 1

Divisible by 6No, remainder 5

Divisible by 7No, remainder 4

Divisible by 8No, remainder 1

Divisible by 9No, remainder 8

Divisible by 10No, remainder 1

Divisible by 11No, remainder 1

Divisible by 12No, remainder 5

Divisible by 100No, remainder 81

Collatz (3n + 1) trajectory

Steps to reach 1150the total stopping time

Highest value reached8,796,1126× the starting value

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

First steps1,446,281 → 4,338,844 → 2,169,422 → 1,084,711 → 3,254,134 → 1,627,067 → 4,881,202 → 2,440,601 → 7,321,804 → 3,660,902 → …

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

As a percentage & fraction

As a percentage144,628,100%

1,446,281% as a decimal14,462.81

1,446,281% of 1001,446,281

1,446,281% of 1,00014,462,810

As a fraction of 1001,446,281/100

Read another way

As seconds16 days, 17 hours and 44 minutes

As bytes1.379 MiB

As a 24-bit colour#161189

Keep nerding

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