Recognised as Number

1,401,631

Positive
Odd
Composite
7 digits

1,401,631 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 7.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value1,401,631

Digit count7

Digit sum16

Digit product0zero, because one of the digits is zero

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

Digital root7repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation7 × 11 × 109 × 167

Distinct prime factors47, 11, 109, 167

Number of divisors16

Sum of divisors σ(n)1,774,080

Aliquot sum372,449sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)44,820the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,075,680

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

SquarefreeYesno repeated prime factor

All divisors1, 7, 11, 77, 109, 167, 763, 1,169, 1,199, 1,837, 8,393, 12,859, 18,203, 127,421, 200,233, 1,401,63116 in total

Arithmetic

Previous number1,401,630

Next number1,401,632

Double2,803,262

Half700,815.5

Square1,964,569,460,161

Cube2,753,601,457,014,922,591

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

Cube root111.912319769≈

Negation-1,401,631

Reciprocal7.1345454 × 10^-7≈

Representations

Decimal1,401,631

Binary10101011000110001111121 bits

Octal5261437

Hexadecimal15631F

Base 36U1I7

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

In wordsone million, four hundred and one thousand, six hundred and thirty-one

Ordinalone million, four hundred and one thousand, six hundred and thirty-first

Scientific notation1.401631 × 10^6

Engineering notation1.401631 × 10^6

In other bases

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

Quinary324323011base 5; one hand: 9 digits

Septenary14625250base 7: 8 digits

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

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

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

Sexagesimal6:29:20:31base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000101010110001100011111

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 63 1f

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

At each machine width

32-bit00000000000101010110001100011111

64-bit0000000000000000000000000000000000000000000101010110001100011111

One's complement11111111111010101001110011100000at 32 bits, every bit flipped

Bits reversed11111000110001101010100000000000at 32 bits

Rotated left by 100000000001010101100011000111110at 32 bits, wrapping

Shifted left by 11010101100011000111110= 2,803,262, no wrap

Shifted right by 110101011000110001111= 700,815, discarding the low bit

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

Nearest landmarks

Next prime1,401,641+10

Previous prime1,401,629−2

Distance to nearest prime2

Nearest square below1,399,489

Nearest square above1,401,856

Powers & multiples

1,401,631 to the power 21,964,569,460,161

1,401,631 to the power 32,753,601,457,014,922,591

1,401,631 to the power 43,859,533,163,797,282,966,145,921

1,401,631 to the power 55,409,641,327,906,349,521,122,073,397,151

First ten multiples1,401,631, 2,803,262, 4,204,893, 5,606,524, 7,008,155, 8,409,786, 9,811,417, 11,213,048, 12,614,679, 14,016,310

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 3

Divisible by 5No, remainder 1

Divisible by 6No, remainder 1

Divisible by 7Yes

Divisible by 8No, remainder 7

Divisible by 9No, remainder 7

Divisible by 10No, remainder 1

Divisible by 11Yes

Divisible by 12No, remainder 7

Divisible by 100No, remainder 31

Collatz (3n + 1) trajectory

Steps to reach 1137the total stopping time

Highest value reached21,287,28415× the starting value

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

First steps1,401,631 → 4,204,894 → 2,102,447 → 6,307,342 → 3,153,671 → 9,461,014 → 4,730,507 → 14,191,522 → 7,095,761 → 21,287,284 → …

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

As a percentage & fraction

As a percentage140,163,100%

1,401,631% as a decimal14,016.31

1,401,631% of 1001,401,631

1,401,631% of 1,00014,016,310

As a fraction of 1001,401,631/100

Read another way

As seconds16 days, 5 hours and 20 minutes

As bytes1.337 MiB

As a 24-bit colour#15631F

Keep nerding

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