Recognised as Number

1,090,381

Positive
Odd
Prime
7 digits

1,090,381 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,090,381

Digit count7

Digit sum22

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times 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,090,381

Distinct prime factors11,090,381

Number of divisors2

Sum of divisors σ(n)1,090,382

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)1,090,380the 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,090,3812 in total

Arithmetic

Previous number1,090,380

Next number1,090,382

Double2,180,762

Half545,190.5

Square1,188,930,725,161

Cube1,296,387,473,031,776,341

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

Cube root102.926236186≈

Negation-1,090,381

Reciprocal9.17110625 × 10^-7≈

Representations

Decimal1,090,381

Binary10000101000110100110121 bits

Octal4121515

Hexadecimal10A34D

Base 36NDCD

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

In wordsone million, ninety thousand, three hundred and eighty-one

Ordinalone million, ninety thousand, three hundred and eighty-first

Scientific notation1.090381 × 10^6

Engineering notation1.090381 × 10^6

In other bases

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

Quinary234343011base 5; one hand: 9 digits

Septenary12160645base 7: 8 digits

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

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

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

Sexagesimal5:2:53:1base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000100001010001101001101

Bit length21 bitsto write the magnitude

Set bits9the population count, or Hamming weight

Zero bits12within that length

Bit parityodd9 set bits, so odd; 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

Bytes310 a3 4d

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

At each machine width

32-bit00000000000100001010001101001101

64-bit0000000000000000000000000000000000000000000100001010001101001101

One's complement11111111111011110101110010110010at 32 bits, every bit flipped

Bits reversed10110010110001010000100000000000at 32 bits

Rotated left by 100000000001000010100011010011010at 32 bits, wrapping

Shifted left by 11000010100011010011010= 2,180,762, no wrap

Shifted right by 110000101000110100110= 545,190, discarding the low bit

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

Nearest landmarks

Next prime1,090,387+6

Previous prime1,090,373−8

Distance to nearest prime0, it is prime

Nearest square below1,089,936

Nearest square above1,092,025

Powers & multiples

1,090,381 to the power 21,188,930,725,161

1,090,381 to the power 31,296,387,473,031,776,341

1,090,381 to the power 41,413,556,269,231,861,318,475,921

1,090,381 to the power 51,541,314,898,401,306,176,301,093,215,901

First ten multiples1,090,381, 2,180,762, 3,271,143, 4,361,524, 5,451,905, 6,542,286, 7,632,667, 8,723,048, 9,813,429, 10,903,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 1

Divisible by 4No, remainder 1

Divisible by 5No, remainder 1

Divisible by 6No, remainder 1

Divisible by 7No, remainder 5

Divisible by 8No, remainder 5

Divisible by 9No, remainder 4

Divisible by 10No, remainder 1

Divisible by 11No, remainder 6

Divisible by 12No, remainder 1

Divisible by 100No, remainder 81

Collatz (3n + 1) trajectory

Steps to reach 1209the total stopping time

Highest value reached3,271,1443× the starting value

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

First steps1,090,381 → 3,271,144 → 1,635,572 → 817,786 → 408,893 → 1,226,680 → 613,340 → 306,670 → 153,335 → 460,006 → …

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

As a percentage & fraction

As a percentage109,038,100%

1,090,381% as a decimal10,903.81

1,090,381% of 1001,090,381

1,090,381% of 1,00010,903,810

As a fraction of 1001,090,381/100

Read another way

As seconds12 days, 14 hours and 53 minutes

As bytes1.04 MiB

As a 24-bit colour#10A34D

Keep nerding

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