Recognised as Number

1,081,433

Positive
Odd
Composite
7 digits

1,081,433 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 2.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value1,081,433

Digit count7

Digit sum20

Digit product0zero, because one of the digits is zero

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

Digital root2repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation337 × 3,209

Distinct prime factors2337, 3,209

Number of divisors4

Sum of divisors σ(n)1,084,980

Aliquot sum3,547sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)134,736the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,077,888

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

SquarefreeYesno repeated prime factor

All divisors1, 337, 3,209, 1,081,4334 in total

Arithmetic

Previous number1,081,432

Next number1,081,434

Double2,162,866

Half540,716.5

Square1,169,497,333,489

Cube1,264,733,009,847,009,737

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

Cube root102.643914441≈

Negation-1,081,433

Reciprocal9.24698987 × 10^-7≈

Representations

Decimal1,081,433

Binary10000100000000101100121 bits

Octal4100131

Hexadecimal108059

Base 36N6FT

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

In wordsone million, eighty-one thousand, four hundred and thirty-three

Ordinalone million, eighty-one thousand, four hundred and thirty-third

Scientific notation1.081433 × 10^6

Engineering notation1.081433 × 10^6

In other bases

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

Quinary234101213base 5; one hand: 9 digits

Septenary12122603base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000000100001000000001011001

Bit length21 bitsto write the magnitude

Set bits6the population count, or Hamming weight

Zero bits15within that length

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

Bytes310 80 59

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

At each machine width

32-bit00000000000100001000000001011001

64-bit0000000000000000000000000000000000000000000100001000000001011001

One's complement11111111111011110111111110100110at 32 bits, every bit flipped

Bits reversed10011010000000010000100000000000at 32 bits

Rotated left by 100000000001000010000000010110010at 32 bits, wrapping

Shifted left by 11000010000000010110010= 2,162,866, no wrap

Shifted right by 110000100000000101100= 540,716, discarding the low bit

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

Nearest landmarks

Next prime1,081,441+8

Previous prime1,081,429−4

Distance to nearest prime4

Nearest square below1,079,521

Nearest square above1,081,600

Powers & multiples

1,081,433 to the power 21,169,497,333,489

1,081,433 to the power 31,264,733,009,847,009,737

1,081,433 to the power 41,367,724,013,037,881,280,913,121

1,081,433 to the power 51,479,101,882,591,595,067,261,719,182,393

First ten multiples1,081,433, 2,162,866, 3,244,299, 4,325,732, 5,407,165, 6,488,598, 7,570,031, 8,651,464, 9,732,897, 10,814,330

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 3

Divisible by 6No, remainder 5

Divisible by 7No, remainder 3

Divisible by 8No, remainder 1

Divisible by 9No, remainder 2

Divisible by 10No, remainder 3

Divisible by 11No, remainder 1

Divisible by 12No, remainder 5

Divisible by 100No, remainder 33

Collatz (3n + 1) trajectory

Steps to reach 1165the total stopping time

Highest value reached3,649,8403× the starting value

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

First steps1,081,433 → 3,244,300 → 1,622,150 → 811,075 → 2,433,226 → 1,216,613 → 3,649,840 → 1,824,920 → 912,460 → 456,230 → …

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

As a percentage & fraction

As a percentage108,143,300%

1,081,433% as a decimal10,814.33

1,081,433% of 1001,081,433

1,081,433% of 1,00010,814,330

As a fraction of 1001,081,433/100

Read another way

As seconds12 days, 12 hours and 23 minutes

As bytes1.031 MiB

As a 24-bit colour#108059

Keep nerding

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