Recognised as Number

1,405,481

Positive
Odd
Composite
7 digits

1,405,481 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 5.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value1,405,481

Digit count7

Digit sum23

Digit product0zero, because one of the digits is zero

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

Digital root5repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation7 × 11 × 18,253

Distinct prime factors37, 11, 18,253

Number of divisors8

Sum of divisors σ(n)1,752,384

Aliquot sum346,903sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)91,260the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,095,120

Möbius function μ(n)−13 distinct prime factors, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 7, 11, 77, 18,253, 127,771, 200,783, 1,405,4818 in total

Arithmetic

Previous number1,405,480

Next number1,405,482

Double2,810,962

Half702,740.5

Square1,975,376,841,361

Cube2,776,354,618,372,899,641

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

Cube root112.014693013≈

Negation-1,405,481

Reciprocal7.11500191 × 10^-7≈

Representations

Decimal1,405,481

Binary10101011100100010100121 bits

Octal5271051

Hexadecimal157229

Base 36U4H5

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

In wordsone million, four hundred and five thousand, four hundred and eighty-one

Ordinalone million, four hundred and five thousand, four hundred and eighty-first

Scientific notation1.405481 × 10^6

Engineering notation1.405481 × 10^6

In other bases

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

Quinary324433411base 5; one hand: 9 digits

Septenary14642420base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000000101010111001000101001

Bit length21 bitsto write the magnitude

Set bits10the population count, or Hamming weight

Zero bits11within that length

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

Bytes315 72 29

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

At each machine width

32-bit00000000000101010111001000101001

64-bit0000000000000000000000000000000000000000000101010111001000101001

One's complement11111111111010101000110111010110at 32 bits, every bit flipped

Bits reversed10010100010011101010100000000000at 32 bits

Rotated left by 100000000001010101110010001010010at 32 bits, wrapping

Shifted left by 11010101110010001010010= 2,810,962, no wrap

Shifted right by 110101011100100010100= 702,740, discarding the low bit

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

Nearest landmarks

Next prime1,405,493+12

Previous prime1,405,477−4

Distance to nearest prime4

Nearest square below1,404,225

Nearest square above1,406,596

Powers & multiples

1,405,481 to the power 21,975,376,841,361

1,405,481 to the power 32,776,354,618,372,899,641

1,405,481 to the power 43,902,113,665,385,361,360,332,321

1,405,481 to the power 55,484,346,616,539,483,070,081,230,851,401

First ten multiples1,405,481, 2,810,962, 4,216,443, 5,621,924, 7,027,405, 8,432,886, 9,838,367, 11,243,848, 12,649,329, 14,054,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 7Yes

Divisible by 8No, remainder 1

Divisible by 9No, remainder 5

Divisible by 10No, remainder 1

Divisible by 11Yes

Divisible by 12No, remainder 5

Divisible by 100No, remainder 81

Collatz (3n + 1) trajectory

Steps to reach 1111the total stopping time

Highest value reached68,383,60048× the starting value

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

First steps1,405,481 → 4,216,444 → 2,108,222 → 1,054,111 → 3,162,334 → 1,581,167 → 4,743,502 → 2,371,751 → 7,115,254 → 3,557,627 → …

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

As a percentage & fraction

As a percentage140,548,100%

1,405,481% as a decimal14,054.81

1,405,481% of 1001,405,481

1,405,481% of 1,00014,054,810

As a fraction of 1001,405,481/100

Read another way

As seconds16 days, 6 hours and 24 minutes

As bytes1.34 MiB

As a 24-bit colour#157229

Keep nerding

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