Recognised as Number

1,404,467

Positive
Odd
Prime
7 digits

1,404,467 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,404,467

Digit count7

Digit sum26

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times 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,404,467

Distinct prime factors11,404,467

Number of divisors2

Sum of divisors σ(n)1,404,468

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)1,404,466the 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,404,4672 in total

Arithmetic

Previous number1,404,466

Next number1,404,468

Double2,808,934

Half702,233.5

Square1,972,527,554,089

Cube2,770,349,856,308,715,563

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

Cube root111.987748447≈

Negation-1,404,467

Reciprocal7.12013881 × 10^-7≈

Representations

Decimal1,404,467

Binary10101011011100011001121 bits

Octal5267063

Hexadecimal156E33

Base 36U3OZ

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

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

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

Scientific notation1.404467 × 10^6

Engineering notation1.404467 × 10^6

In other bases

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

Quinary324420332base 5; one hand: 9 digits

Septenary14636441base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000000101010110111000110011

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 33

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

At each machine width

32-bit00000000000101010110111000110011

64-bit0000000000000000000000000000000000000000000101010110111000110011

One's complement11111111111010101001000111001100at 32 bits, every bit flipped

Bits reversed11001100011101101010100000000000at 32 bits

Rotated left by 100000000001010101101110001100110at 32 bits, wrapping

Shifted left by 11010101101110001100110= 2,808,934, no wrap

Shifted right by 110101011011100011001= 702,233, discarding the low bit

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

Nearest landmarks

Next prime1,404,479+12

Previous prime1,404,439−28

Distance to nearest prime0, it is prime

Nearest square below1,404,225

Nearest square above1,406,596

Powers & multiples

1,404,467 to the power 21,972,527,554,089

1,404,467 to the power 32,770,349,856,308,715,563

1,404,467 to the power 43,890,864,951,640,332,820,619,921

1,404,467 to the power 55,464,591,426,035,443,315,577,598,587,107

First ten multiples1,404,467, 2,808,934, 4,213,401, 5,617,868, 7,022,335, 8,426,802, 9,831,269, 11,235,736, 12,640,203, 14,044,670

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 3

Divisible by 5No, remainder 2

Divisible by 6No, remainder 5

Divisible by 7No, remainder 1

Divisible by 8No, remainder 3

Divisible by 9No, remainder 8

Divisible by 10No, remainder 7

Divisible by 11No, remainder 9

Divisible by 12No, remainder 11

Divisible by 100No, remainder 67

Collatz (3n + 1) trajectory

Steps to reach 1129the total stopping time

Highest value reached6,749,0804× the starting value

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

First steps1,404,467 → 4,213,402 → 2,106,701 → 6,320,104 → 3,160,052 → 1,580,026 → 790,013 → 2,370,040 → 1,185,020 → 592,510 → …

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

As a percentage & fraction

As a percentage140,446,700%

1,404,467% as a decimal14,044.67

1,404,467% of 1001,404,467

1,404,467% of 1,00014,044,670

As a fraction of 1001,404,467/100

Read another way

As seconds16 days, 6 hours and 7 minutes

As bytes1.339 MiB

As a 24-bit colour#156E33

Keep nerding

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