Recognised as Number

1,404,469

Positive
Odd
Composite
7 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value1,404,469

Digit count7

Digit sum28

Digit product0zero, because one of the digits is zero

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

Digital root1repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation11 × 127,679

Distinct prime factors211, 127,679

Number of divisors4

Sum of divisors σ(n)1,532,160

Aliquot sum127,691sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)638,390the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,276,780

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

SquarefreeYesno repeated prime factor

All divisors1, 11, 127,679, 1,404,4694 in total

Arithmetic

Previous number1,404,468

Next number1,404,470

Double2,808,938

Half702,234.5

Square1,972,533,171,961

Cube2,770,361,691,490,893,709

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

Cube root111.987801605≈

Negation-1,404,469

Reciprocal7.12012867 × 10^-7≈

Representations

Decimal1,404,469

Binary10101011011100011010121 bits

Octal5267065

Hexadecimal156E35

Base 36U3P1

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

In wordsone million, four hundred and four thousand, four hundred and sixty-nine

Ordinalone million, four hundred and four thousand, four hundred and sixty-ninth

Scientific notation1.404469 × 10^6

Engineering notation1.404469 × 10^6

In other bases

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

Quinary324420334base 5; one hand: 9 digits

Septenary14636443base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000000101010110111000110101

Bit length21 bitsto write the magnitude

Set bits12the population count, or Hamming weight

Zero bits9within that length

Bit parityeven12 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 6e 35

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

At each machine width

32-bit00000000000101010110111000110101

64-bit0000000000000000000000000000000000000000000101010110111000110101

One's complement11111111111010101001000111001010at 32 bits, every bit flipped

Bits reversed10101100011101101010100000000000at 32 bits

Rotated left by 100000000001010101101110001101010at 32 bits, wrapping

Shifted left by 11010101101110001101010= 2,808,938, no wrap

Shifted right by 110101011011100011010= 702,234, discarding the low bit

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

Nearest landmarks

Next prime1,404,479+10

Previous prime1,404,467−2

Distance to nearest prime2

Nearest square below1,404,225

Nearest square above1,406,596

Powers & multiples

1,404,469 to the power 21,972,533,171,961

1,404,469 to the power 32,770,361,691,490,893,709

1,404,469 to the power 43,890,887,114,486,523,996,585,521

1,404,469 to the power 55,464,630,334,795,773,870,960,470,093,349

First ten multiples1,404,469, 2,808,938, 4,213,407, 5,617,876, 7,022,345, 8,426,814, 9,831,283, 11,235,752, 12,640,221, 14,044,690

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 4

Divisible by 6No, remainder 1

Divisible by 7No, remainder 3

Divisible by 8No, remainder 5

Divisible by 9No, remainder 1

Divisible by 10No, remainder 9

Divisible by 11Yes

Divisible by 12No, remainder 1

Divisible by 100No, remainder 69

Collatz (3n + 1) trajectory

Steps to reach 1124the total stopping time

Highest value reached4,213,4083× the starting value

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

First steps1,404,469 → 4,213,408 → 2,106,704 → 1,053,352 → 526,676 → 263,338 → 131,669 → 395,008 → 197,504 → 98,752 → …

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

As a percentage & fraction

As a percentage140,446,900%

1,404,469% as a decimal14,044.69

1,404,469% of 1001,404,469

1,404,469% of 1,00014,044,690

As a fraction of 1001,404,469/100

Read another way

As seconds16 days, 6 hours and 7 minutes

As bytes1.339 MiB

As a 24-bit colour#156E35

Keep nerding

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